About the Execution of ITS-Tools for ShieldIIPt-PT-030B
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15771.480 | 3600000.00 | 3502709.00 | 220724.30 | [undef] | Time out reached |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2020-input.r210-tajo-159033475600340.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-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 itstools
Input is ShieldIIPt-PT-030B, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r210-tajo-159033475600340
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 676K
-rw-r--r-- 1 mcc users 3.5K May 14 01:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K May 14 01:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 13 18:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 13 18:26 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 14 10:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 14 10:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 14 10:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 14 10:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 3.0K May 13 13:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 14K May 13 13:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 13 08:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K May 13 08:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 13 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 13 16:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 20:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 12 20:42 instance
-rw-r--r-- 1 mcc users 6 May 12 20:42 iscolored
-rw-r--r-- 1 mcc users 512K May 12 20:42 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 ShieldIIPt-PT-030B-CTLFireability-00
FORMULA_NAME ShieldIIPt-PT-030B-CTLFireability-01
FORMULA_NAME ShieldIIPt-PT-030B-CTLFireability-02
FORMULA_NAME ShieldIIPt-PT-030B-CTLFireability-03
FORMULA_NAME ShieldIIPt-PT-030B-CTLFireability-04
FORMULA_NAME ShieldIIPt-PT-030B-CTLFireability-05
FORMULA_NAME ShieldIIPt-PT-030B-CTLFireability-06
FORMULA_NAME ShieldIIPt-PT-030B-CTLFireability-07
FORMULA_NAME ShieldIIPt-PT-030B-CTLFireability-08
FORMULA_NAME ShieldIIPt-PT-030B-CTLFireability-09
FORMULA_NAME ShieldIIPt-PT-030B-CTLFireability-10
FORMULA_NAME ShieldIIPt-PT-030B-CTLFireability-11
FORMULA_NAME ShieldIIPt-PT-030B-CTLFireability-12
FORMULA_NAME ShieldIIPt-PT-030B-CTLFireability-13
FORMULA_NAME ShieldIIPt-PT-030B-CTLFireability-14
FORMULA_NAME ShieldIIPt-PT-030B-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1590583753671
[2020-05-27 12:49:15] [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]
[2020-05-27 12:49:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-27 12:49:15] [INFO ] Load time of PNML (sax parser for PT used): 145 ms
[2020-05-27 12:49:15] [INFO ] Transformed 2103 places.
[2020-05-27 12:49:15] [INFO ] Transformed 1953 transitions.
[2020-05-27 12:49:15] [INFO ] Found NUPN structural information;
[2020-05-27 12:49:15] [INFO ] Parsed PT model containing 2103 places and 1953 transitions in 237 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 47 ms.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 845 ms. (steps per millisecond=118 ) properties seen :[0, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 1, 1, 0, 1, 1, 1, 0, 0, 0, 1, 1, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 1, 1]
// Phase 1: matrix 1953 rows 2103 cols
[2020-05-27 12:49:16] [INFO ] Computed 271 place invariants in 72 ms
[2020-05-27 12:49:17] [INFO ] [Real]Absence check using 271 positive place invariants in 405 ms returned sat
[2020-05-27 12:49:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 12:49:25] [INFO ] [Real]Absence check using state equation in 8153 ms returned sat
[2020-05-27 12:49:25] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 12:49:26] [INFO ] [Nat]Absence check using 271 positive place invariants in 512 ms returned sat
[2020-05-27 12:49:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 12:49:35] [INFO ] [Nat]Absence check using state equation in 8439 ms returned sat
[2020-05-27 12:49:36] [INFO ] Deduced a trap composed of 28 places in 986 ms
[2020-05-27 12:49:37] [INFO ] Deduced a trap composed of 18 places in 1136 ms
[2020-05-27 12:49:38] [INFO ] Deduced a trap composed of 27 places in 963 ms
[2020-05-27 12:49:39] [INFO ] Deduced a trap composed of 29 places in 1005 ms
[2020-05-27 12:49:40] [INFO ] Deduced a trap composed of 17 places in 951 ms
[2020-05-27 12:49:41] [INFO ] Deduced a trap composed of 35 places in 922 ms
[2020-05-27 12:49:42] [INFO ] Deduced a trap composed of 32 places in 826 ms
[2020-05-27 12:49:43] [INFO ] Deduced a trap composed of 21 places in 816 ms
[2020-05-27 12:49:44] [INFO ] Deduced a trap composed of 33 places in 1000 ms
[2020-05-27 12:49:45] [INFO ] Deduced a trap composed of 28 places in 905 ms
[2020-05-27 12:49:46] [INFO ] Deduced a trap composed of 30 places in 878 ms
[2020-05-27 12:49: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 (> (+ s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s1275 s1276 s1277 s1278 s1279 s1280 s1281 s1282 s1283 s1334 s1335 s1336 s1337 s1338 s1339 s1340 s1341 s1342) 0)") while checking expression at index 0
[2020-05-27 12:49:46] [INFO ] [Real]Absence check using 271 positive place invariants in 267 ms returned sat
[2020-05-27 12:49:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 12:49:55] [INFO ] [Real]Absence check using state equation in 8298 ms returned sat
[2020-05-27 12:49:55] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 12:49:56] [INFO ] [Nat]Absence check using 271 positive place invariants in 684 ms returned sat
[2020-05-27 12:49:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 12:50:04] [INFO ] [Nat]Absence check using state equation in 8437 ms returned sat
[2020-05-27 12:50:05] [INFO ] Deduced a trap composed of 17 places in 1346 ms
[2020-05-27 12:50:07] [INFO ] Deduced a trap composed of 22 places in 1030 ms
[2020-05-27 12:50:08] [INFO ] Deduced a trap composed of 38 places in 1093 ms
[2020-05-27 12:50:09] [INFO ] Deduced a trap composed of 32 places in 988 ms
[2020-05-27 12:50:10] [INFO ] Deduced a trap composed of 30 places in 1108 ms
[2020-05-27 12:50:11] [INFO ] Deduced a trap composed of 21 places in 792 ms
[2020-05-27 12:50:12] [INFO ] Deduced a trap composed of 28 places in 985 ms
[2020-05-27 12:50:13] [INFO ] Deduced a trap composed of 30 places in 796 ms
[2020-05-27 12:50:14] [INFO ] Deduced a trap composed of 37 places in 886 ms
[2020-05-27 12:50:15] [INFO ] Deduced a trap composed of 41 places in 977 ms
[2020-05-27 12:50:15] [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 s999 s1000 s1020 s1021 s1024 s1025 s1026 s1027 s1028 s1029 s1030 s1031 s1032 s1057 s1066 s1067 s1115 s1116 s1117 s1118 s1119 s1120 s1121 s1122 s1123) 0)") while checking expression at index 1
[2020-05-27 12:50:15] [INFO ] [Real]Absence check using 271 positive place invariants in 268 ms returned sat
[2020-05-27 12:50:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 12:50:24] [INFO ] [Real]Absence check using state equation in 8218 ms returned sat
[2020-05-27 12:50:24] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 12:50:25] [INFO ] [Nat]Absence check using 271 positive place invariants in 664 ms returned sat
[2020-05-27 12:50:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 12:50:32] [INFO ] [Nat]Absence check using state equation in 7546 ms returned sat
[2020-05-27 12:50:33] [INFO ] Deduced a trap composed of 27 places in 1075 ms
[2020-05-27 12:50:34] [INFO ] Deduced a trap composed of 21 places in 923 ms
[2020-05-27 12:50:35] [INFO ] Deduced a trap composed of 25 places in 982 ms
[2020-05-27 12:50:37] [INFO ] Deduced a trap composed of 18 places in 1122 ms
[2020-05-27 12:50:38] [INFO ] Deduced a trap composed of 32 places in 885 ms
[2020-05-27 12:50:39] [INFO ] Deduced a trap composed of 19 places in 882 ms
[2020-05-27 12:50:40] [INFO ] Deduced a trap composed of 22 places in 1020 ms
[2020-05-27 12:50:41] [INFO ] Deduced a trap composed of 17 places in 896 ms
[2020-05-27 12:50:42] [INFO ] Deduced a trap composed of 34 places in 913 ms
[2020-05-27 12:50:43] [INFO ] Deduced a trap composed of 26 places in 959 ms
[2020-05-27 12:50:44] [INFO ] Deduced a trap composed of 26 places in 993 ms
[2020-05-27 12:50:45] [INFO ] Deduced a trap composed of 13 places in 1336 ms
[2020-05-27 12:50:45] [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 s1965 s1966 s1967 s1968 s1973 s1974 s1975 s2001 s2008 s2009 s2010) 0)") while checking expression at index 2
[2020-05-27 12:50:46] [INFO ] [Real]Absence check using 271 positive place invariants in 259 ms returned sat
[2020-05-27 12:50:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 12:50:54] [INFO ] [Real]Absence check using state equation in 8109 ms returned sat
[2020-05-27 12:50:54] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 12:50:55] [INFO ] [Nat]Absence check using 271 positive place invariants in 630 ms returned sat
[2020-05-27 12:50:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 12:51:02] [INFO ] [Nat]Absence check using state equation in 7702 ms returned sat
[2020-05-27 12:51:04] [INFO ] Deduced a trap composed of 35 places in 1020 ms
[2020-05-27 12:51:05] [INFO ] Deduced a trap composed of 21 places in 961 ms
[2020-05-27 12:51:06] [INFO ] Deduced a trap composed of 17 places in 990 ms
[2020-05-27 12:51:06] [INFO ] Deduced a trap composed of 35 places in 786 ms
[2020-05-27 12:51:07] [INFO ] Deduced a trap composed of 28 places in 841 ms
[2020-05-27 12:51:08] [INFO ] Deduced a trap composed of 27 places in 751 ms
[2020-05-27 12:51:09] [INFO ] Deduced a trap composed of 20 places in 761 ms
[2020-05-27 12:51:10] [INFO ] Deduced a trap composed of 36 places in 750 ms
[2020-05-27 12:51:11] [INFO ] Deduced a trap composed of 28 places in 938 ms
[2020-05-27 12:51:12] [INFO ] Deduced a trap composed of 31 places in 862 ms
[2020-05-27 12:51:13] [INFO ] Deduced a trap composed of 37 places in 980 ms
[2020-05-27 12:51:14] [INFO ] Deduced a trap composed of 24 places in 898 ms
[2020-05-27 12:51:15] [INFO ] Deduced a trap composed of 13 places in 1375 ms
[2020-05-27 12:51:15] [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 s1965 s1966 s1967 s1968 s1973 s1974 s1975 s2001 s2008 s2009 s2010) 0)") while checking expression at index 3
[2020-05-27 12:51:16] [INFO ] [Real]Absence check using 271 positive place invariants in 261 ms returned sat
[2020-05-27 12:51:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 12:51:24] [INFO ] [Real]Absence check using state equation in 8238 ms returned sat
[2020-05-27 12:51:24] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 12:51:25] [INFO ] [Nat]Absence check using 271 positive place invariants in 515 ms returned sat
[2020-05-27 12:51:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 12:51:33] [INFO ] [Nat]Absence check using state equation in 8480 ms returned sat
[2020-05-27 12:51:34] [INFO ] Deduced a trap composed of 33 places in 917 ms
[2020-05-27 12:51:35] [INFO ] Deduced a trap composed of 32 places in 1130 ms
[2020-05-27 12:51:37] [INFO ] Deduced a trap composed of 37 places in 986 ms
[2020-05-27 12:51:38] [INFO ] Deduced a trap composed of 26 places in 930 ms
[2020-05-27 12:51:39] [INFO ] Deduced a trap composed of 22 places in 904 ms
[2020-05-27 12:51:40] [INFO ] Deduced a trap composed of 21 places in 1074 ms
[2020-05-27 12:51:40] [INFO ] Deduced a trap composed of 20 places in 790 ms
[2020-05-27 12:51:41] [INFO ] Deduced a trap composed of 32 places in 874 ms
[2020-05-27 12:51:42] [INFO ] Deduced a trap composed of 17 places in 887 ms
[2020-05-27 12:51:43] [INFO ] Deduced a trap composed of 27 places in 826 ms
[2020-05-27 12:51:44] [INFO ] Deduced a trap composed of 18 places in 826 ms
[2020-05-27 12:51:44] [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 s1620 s1621 s1638 s1639 s1640 s1641 s1642 s1643 s1678 s1687 s1688) 0)") while checking expression at index 4
[2020-05-27 12:51:45] [INFO ] [Real]Absence check using 271 positive place invariants in 313 ms returned sat
[2020-05-27 12:51:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 12:51:52] [INFO ] [Real]Absence check using state equation in 7583 ms returned sat
[2020-05-27 12:51:54] [INFO ] Deduced a trap composed of 13 places in 1068 ms
[2020-05-27 12:51:55] [INFO ] Deduced a trap composed of 25 places in 889 ms
[2020-05-27 12:51:56] [INFO ] Deduced a trap composed of 18 places in 943 ms
[2020-05-27 12:51:57] [INFO ] Deduced a trap composed of 36 places in 903 ms
[2020-05-27 12:51:58] [INFO ] Deduced a trap composed of 17 places in 875 ms
[2020-05-27 12:51:59] [INFO ] Deduced a trap composed of 33 places in 873 ms
[2020-05-27 12:52:00] [INFO ] Deduced a trap composed of 23 places in 1066 ms
[2020-05-27 12:52:01] [INFO ] Deduced a trap composed of 31 places in 944 ms
[2020-05-27 12:52:02] [INFO ] Deduced a trap composed of 20 places in 988 ms
[2020-05-27 12:52:03] [INFO ] Deduced a trap composed of 28 places in 992 ms
[2020-05-27 12:52:04] [INFO ] Deduced a trap composed of 25 places in 880 ms
[2020-05-27 12:52:05] [INFO ] Deduced a trap composed of 18 places in 814 ms
[2020-05-27 12:52:05] [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 s1620 s1621 s1638 s1639 s1640 s1641 s1642 s1643 s1678 s1687 s1688) 0)") while checking expression at index 5
[2020-05-27 12:52:06] [INFO ] [Real]Absence check using 271 positive place invariants in 516 ms returned sat
[2020-05-27 12:52:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 12:52:15] [INFO ] [Real]Absence check using state equation in 9436 ms returned sat
[2020-05-27 12:52:16] [INFO ] Deduced a trap composed of 24 places in 1219 ms
[2020-05-27 12:52:17] [INFO ] Deduced a trap composed of 18 places in 1040 ms
[2020-05-27 12:52:18] [INFO ] Deduced a trap composed of 25 places in 790 ms
[2020-05-27 12:52:19] [INFO ] Deduced a trap composed of 30 places in 744 ms
[2020-05-27 12:52:20] [INFO ] Deduced a trap composed of 25 places in 761 ms
[2020-05-27 12:52:21] [INFO ] Deduced a trap composed of 24 places in 755 ms
[2020-05-27 12:52:22] [INFO ] Deduced a trap composed of 26 places in 751 ms
[2020-05-27 12:52:22] [INFO ] Deduced a trap composed of 30 places in 736 ms
[2020-05-27 12:52:23] [INFO ] Deduced a trap composed of 17 places in 734 ms
[2020-05-27 12:52:24] [INFO ] Deduced a trap composed of 25 places in 736 ms
[2020-05-27 12:52:25] [INFO ] Deduced a trap composed of 28 places in 697 ms
[2020-05-27 12:52:26] [INFO ] Deduced a trap composed of 13 places in 1321 ms
[2020-05-27 12:52:26] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s1965 s1966 s1967 s1968 s1973 s1974 s1975 s2001 s2008 s2009 s2010) 0)") while checking expression at index 6
[2020-05-27 12:52:27] [INFO ] [Real]Absence check using 271 positive place invariants in 380 ms returned sat
[2020-05-27 12:52:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 12:52:34] [INFO ] [Real]Absence check using state equation in 7509 ms returned sat
[2020-05-27 12:52:36] [INFO ] Deduced a trap composed of 17 places in 1149 ms
[2020-05-27 12:52:37] [INFO ] Deduced a trap composed of 31 places in 952 ms
[2020-05-27 12:52:38] [INFO ] Deduced a trap composed of 29 places in 913 ms
[2020-05-27 12:52:39] [INFO ] Deduced a trap composed of 27 places in 1132 ms
[2020-05-27 12:52:42] [INFO ] Deduced a trap composed of 28 places in 3325 ms
[2020-05-27 12:52:43] [INFO ] Deduced a trap composed of 27 places in 887 ms
[2020-05-27 12:52:45] [INFO ] Deduced a trap composed of 26 places in 1410 ms
[2020-05-27 12:52:46] [INFO ] Deduced a trap composed of 33 places in 1070 ms
[2020-05-27 12:52:47] [INFO ] Deduced a trap composed of 36 places in 1107 ms
[2020-05-27 12:52:47] [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 s1551 s1552 s1553 s1554 s1555 s1561 s1562 s1563 s1566 s1575 s1584 s1585 s1586 s1588 s1589 s1590 s1591 s1592 s1593 s1594 s1610 s1611 s1613 s1614 s1615 s1616 s1617 s1618) 0)") while checking expression at index 7
[2020-05-27 12:52:47] [INFO ] [Real]Absence check using 271 positive place invariants in 279 ms returned sat
[2020-05-27 12:52:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 12:52:56] [INFO ] [Real]Absence check using state equation in 8087 ms returned sat
[2020-05-27 12:52:57] [INFO ] Deduced a trap composed of 23 places in 1169 ms
[2020-05-27 12:52:58] [INFO ] Deduced a trap composed of 21 places in 961 ms
[2020-05-27 12:52:59] [INFO ] Deduced a trap composed of 24 places in 1163 ms
[2020-05-27 12:53:00] [INFO ] Deduced a trap composed of 17 places in 1246 ms
[2020-05-27 12:53:01] [INFO ] Deduced a trap composed of 20 places in 986 ms
[2020-05-27 12:53:02] [INFO ] Deduced a trap composed of 24 places in 870 ms
[2020-05-27 12:53:03] [INFO ] Deduced a trap composed of 41 places in 885 ms
[2020-05-27 12:53:04] [INFO ] Deduced a trap composed of 18 places in 845 ms
[2020-05-27 12:53:05] [INFO ] Deduced a trap composed of 17 places in 1083 ms
[2020-05-27 12:53:06] [INFO ] Deduced a trap composed of 23 places in 976 ms
[2020-05-27 12:53:08] [INFO ] Deduced a trap composed of 36 places in 1140 ms
[2020-05-27 12:53:08] [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 s1365 s1366 s1367 s1413 s1414 s1415 s1424 s1425 s1430 s1450 s1451 s1452 s1453 s1454 s1455 s1456 s1459 s1461 s1463 s1464 s1465 s1466 s1467 s1468 s1469 s1470) 0)") while checking expression at index 8
[2020-05-27 12:53:08] [INFO ] [Real]Absence check using 271 positive place invariants in 311 ms returned sat
[2020-05-27 12:53:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 12:53:17] [INFO ] [Real]Absence check using state equation in 8758 ms returned sat
[2020-05-27 12:53:18] [INFO ] Deduced a trap composed of 27 places in 1066 ms
[2020-05-27 12:53:19] [INFO ] Deduced a trap composed of 32 places in 902 ms
[2020-05-27 12:53:20] [INFO ] Deduced a trap composed of 37 places in 911 ms
[2020-05-27 12:53:21] [INFO ] Deduced a trap composed of 26 places in 1004 ms
[2020-05-27 12:53:22] [INFO ] Deduced a trap composed of 27 places in 822 ms
[2020-05-27 12:53:23] [INFO ] Deduced a trap composed of 17 places in 921 ms
[2020-05-27 12:53:24] [INFO ] Deduced a trap composed of 30 places in 869 ms
[2020-05-27 12:53:25] [INFO ] Deduced a trap composed of 24 places in 864 ms
[2020-05-27 12:53:26] [INFO ] Deduced a trap composed of 32 places in 864 ms
[2020-05-27 12:53:27] [INFO ] Deduced a trap composed of 34 places in 725 ms
[2020-05-27 12:53:27] [INFO ] Deduced a trap composed of 26 places in 739 ms
[2020-05-27 12:53:28] [INFO ] Deduced a trap composed of 18 places in 712 ms
[2020-05-27 12:53: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 s1620 s1621 s1638 s1639 s1640 s1641 s1642 s1643 s1678 s1687 s1688) 0)") while checking expression at index 9
[2020-05-27 12:53:29] [INFO ] [Real]Absence check using 271 positive place invariants in 260 ms returned sat
[2020-05-27 12:53:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 12:53:37] [INFO ] [Real]Absence check using state equation in 7985 ms returned sat
[2020-05-27 12:53:37] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 12:53:38] [INFO ] [Nat]Absence check using 271 positive place invariants in 714 ms returned sat
[2020-05-27 12:53:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 12:53:45] [INFO ] [Nat]Absence check using state equation in 7725 ms returned sat
[2020-05-27 12:53:47] [INFO ] Deduced a trap composed of 31 places in 1162 ms
[2020-05-27 12:53:48] [INFO ] Deduced a trap composed of 18 places in 1184 ms
[2020-05-27 12:53:49] [INFO ] Deduced a trap composed of 29 places in 1083 ms
[2020-05-27 12:53:50] [INFO ] Deduced a trap composed of 26 places in 958 ms
[2020-05-27 12:53:51] [INFO ] Deduced a trap composed of 31 places in 941 ms
[2020-05-27 12:53:52] [INFO ] Deduced a trap composed of 21 places in 1034 ms
[2020-05-27 12:53:53] [INFO ] Deduced a trap composed of 21 places in 864 ms
[2020-05-27 12:53:54] [INFO ] Deduced a trap composed of 27 places in 807 ms
[2020-05-27 12:53:55] [INFO ] Deduced a trap composed of 20 places in 796 ms
[2020-05-27 12:53:56] [INFO ] Deduced a trap composed of 32 places in 844 ms
[2020-05-27 12:53:57] [INFO ] Deduced a trap composed of 18 places in 1064 ms
[2020-05-27 12:53: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 s1620 s1621 s1638 s1639 s1640 s1641 s1642 s1643 s1678 s1687 s1688) 0)") while checking expression at index 10
[2020-05-27 12:53:58] [INFO ] [Real]Absence check using 271 positive place invariants in 420 ms returned sat
[2020-05-27 12:53:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 12:54:06] [INFO ] [Real]Absence check using state equation in 7872 ms returned sat
[2020-05-27 12:54:06] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 12:54:07] [INFO ] [Nat]Absence check using 271 positive place invariants in 778 ms returned sat
[2020-05-27 12:54:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 12:54:15] [INFO ] [Nat]Absence check using state equation in 8370 ms returned sat
[2020-05-27 12:54:16] [INFO ] Deduced a trap composed of 28 places in 1062 ms
[2020-05-27 12:54:17] [INFO ] Deduced a trap composed of 22 places in 975 ms
[2020-05-27 12:54:18] [INFO ] Deduced a trap composed of 29 places in 799 ms
[2020-05-27 12:54:19] [INFO ] Deduced a trap composed of 22 places in 769 ms
[2020-05-27 12:54:20] [INFO ] Deduced a trap composed of 17 places in 769 ms
[2020-05-27 12:54:21] [INFO ] Deduced a trap composed of 26 places in 767 ms
[2020-05-27 12:54:22] [INFO ] Deduced a trap composed of 30 places in 859 ms
[2020-05-27 12:54:22] [INFO ] Deduced a trap composed of 29 places in 838 ms
[2020-05-27 12:54:23] [INFO ] Deduced a trap composed of 26 places in 735 ms
[2020-05-27 12:54:24] [INFO ] Deduced a trap composed of 27 places in 783 ms
[2020-05-27 12:54:25] [INFO ] Deduced a trap composed of 29 places in 930 ms
[2020-05-27 12:54:26] [INFO ] Deduced a trap composed of 27 places in 705 ms
[2020-05-27 12:54:26] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s1413 s1414 s1415 s1416 s1417 s1418 s1434 s1436 s1472 s1473 s1474 s1475 s1476 s1477 s1478 s1479 s1480) 0)") while checking expression at index 11
[2020-05-27 12:54:26] [INFO ] [Real]Absence check using 271 positive place invariants in 252 ms returned sat
[2020-05-27 12:54:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 12:54:35] [INFO ] [Real]Absence check using state equation in 8990 ms returned sat
[2020-05-27 12:54:36] [INFO ] Deduced a trap composed of 34 places in 1016 ms
[2020-05-27 12:54:37] [INFO ] Deduced a trap composed of 21 places in 770 ms
[2020-05-27 12:54:38] [INFO ] Deduced a trap composed of 24 places in 754 ms
[2020-05-27 12:54:39] [INFO ] Deduced a trap composed of 29 places in 775 ms
[2020-05-27 12:54:40] [INFO ] Deduced a trap composed of 24 places in 758 ms
[2020-05-27 12:54:41] [INFO ] Deduced a trap composed of 25 places in 740 ms
[2020-05-27 12:54:41] [INFO ] Deduced a trap composed of 17 places in 736 ms
[2020-05-27 12:54:42] [INFO ] Deduced a trap composed of 18 places in 716 ms
[2020-05-27 12:54:43] [INFO ] Deduced a trap composed of 26 places in 755 ms
[2020-05-27 12:54:44] [INFO ] Deduced a trap composed of 24 places in 741 ms
[2020-05-27 12:54:45] [INFO ] Deduced a trap composed of 25 places in 856 ms
[2020-05-27 12:54:46] [INFO ] Deduced a trap composed of 29 places in 770 ms
[2020-05-27 12:54:47] [INFO ] Deduced a trap composed of 31 places in 1009 ms
[2020-05-27 12:54:47] [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 s1224 s1225 s1226 s1231 s1232 s1233 s1234 s1235 s1236 s1237 s1239 s1275 s1276 s1277 s1278 s1279 s1280 s1281 s1293) 0)") while checking expression at index 12
[2020-05-27 12:54:47] [INFO ] [Real]Absence check using 271 positive place invariants in 261 ms returned sat
[2020-05-27 12:54:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 12:54:55] [INFO ] [Real]Absence check using state equation in 8235 ms returned sat
[2020-05-27 12:54:55] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 12:54:56] [INFO ] [Nat]Absence check using 271 positive place invariants in 715 ms returned sat
[2020-05-27 12:54:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 12:55:04] [INFO ] [Nat]Absence check using state equation in 8009 ms returned sat
[2020-05-27 12:55:06] [INFO ] Deduced a trap composed of 20 places in 1067 ms
[2020-05-27 12:55:07] [INFO ] Deduced a trap composed of 28 places in 937 ms
[2020-05-27 12:55:08] [INFO ] Deduced a trap composed of 32 places in 1042 ms
[2020-05-27 12:55:09] [INFO ] Deduced a trap composed of 26 places in 904 ms
[2020-05-27 12:55:10] [INFO ] Deduced a trap composed of 17 places in 1007 ms
[2020-05-27 12:55:11] [INFO ] Deduced a trap composed of 34 places in 863 ms
[2020-05-27 12:55:12] [INFO ] Deduced a trap composed of 25 places in 920 ms
[2020-05-27 12:55:13] [INFO ] Deduced a trap composed of 28 places in 739 ms
[2020-05-27 12:55:13] [INFO ] Deduced a trap composed of 25 places in 843 ms
[2020-05-27 12:55:14] [INFO ] Deduced a trap composed of 23 places in 897 ms
[2020-05-27 12:55:15] [INFO ] Deduced a trap composed of 28 places in 863 ms
[2020-05-27 12:55:15] [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 s1990 s1991 s1992 s1993 s1994 s1995 s1996 s1997 s1998 s2034 s2035 s2036 s2037 s2038 s2052 s2053 s2058 s2059 s2060 s2061 s2062 s2063 s2064 s2065 s2067 s2068 s2069) 0)") while checking expression at index 13
[2020-05-27 12:55:16] [INFO ] [Real]Absence check using 271 positive place invariants in 388 ms returned sat
[2020-05-27 12:55:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 12:55:24] [INFO ] [Real]Absence check using state equation in 8174 ms returned sat
[2020-05-27 12:55:24] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 12:55:25] [INFO ] [Nat]Absence check using 271 positive place invariants in 659 ms returned sat
[2020-05-27 12:55:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 12:55:33] [INFO ] [Nat]Absence check using state equation in 7398 ms returned sat
[2020-05-27 12:55:34] [INFO ] Deduced a trap composed of 22 places in 1110 ms
[2020-05-27 12:55:35] [INFO ] Deduced a trap composed of 20 places in 789 ms
[2020-05-27 12:55:36] [INFO ] Deduced a trap composed of 20 places in 1083 ms
[2020-05-27 12:55:37] [INFO ] Deduced a trap composed of 14 places in 1036 ms
[2020-05-27 12:55:38] [INFO ] Deduced a trap composed of 17 places in 1001 ms
[2020-05-27 12:55:39] [INFO ] Deduced a trap composed of 25 places in 984 ms
[2020-05-27 12:55:40] [INFO ] Deduced a trap composed of 21 places in 846 ms
[2020-05-27 12:55:41] [INFO ] Deduced a trap composed of 21 places in 806 ms
[2020-05-27 12:55:42] [INFO ] Deduced a trap composed of 32 places in 844 ms
[2020-05-27 12:55:43] [INFO ] Deduced a trap composed of 39 places in 847 ms
[2020-05-27 12:55:44] [INFO ] Deduced a trap composed of 21 places in 755 ms
[2020-05-27 12:55:44] [INFO ] Deduced a trap composed of 24 places in 705 ms
[2020-05-27 12:55:46] [INFO ] Deduced a trap composed of 13 places in 1306 ms
[2020-05-27 12:55: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 (> (+ s0 s1 s1965 s1966 s1967 s1968 s1973 s1974 s1975 s2001 s2008 s2009 s2010) 0)") while checking expression at index 14
[2020-05-27 12:55:46] [INFO ] [Real]Absence check using 271 positive place invariants in 258 ms returned sat
[2020-05-27 12:55:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 12:55:54] [INFO ] [Real]Absence check using state equation in 7878 ms returned sat
[2020-05-27 12:55:55] [INFO ] Deduced a trap composed of 17 places in 1022 ms
[2020-05-27 12:55:56] [INFO ] Deduced a trap composed of 18 places in 754 ms
[2020-05-27 12:55:57] [INFO ] Deduced a trap composed of 24 places in 1004 ms
[2020-05-27 12:55:58] [INFO ] Deduced a trap composed of 31 places in 761 ms
[2020-05-27 12:55:59] [INFO ] Deduced a trap composed of 29 places in 762 ms
[2020-05-27 12:56:00] [INFO ] Deduced a trap composed of 28 places in 738 ms
[2020-05-27 12:56:00] [INFO ] Deduced a trap composed of 21 places in 713 ms
[2020-05-27 12:56:01] [INFO ] Deduced a trap composed of 24 places in 734 ms
[2020-05-27 12:56:02] [INFO ] Deduced a trap composed of 26 places in 699 ms
[2020-05-27 12:56:03] [INFO ] Deduced a trap composed of 18 places in 775 ms
[2020-05-27 12:56:03] [INFO ] Deduced a trap composed of 28 places in 705 ms
[2020-05-27 12:56:04] [INFO ] Deduced a trap composed of 22 places in 892 ms
[2020-05-27 12:56:05] [INFO ] Deduced a trap composed of 26 places in 674 ms
[2020-05-27 12:56:06] [INFO ] Deduced a trap composed of 25 places in 676 ms
[2020-05-27 12:56: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 s1827 s1828 s1852 s1853 s1854 s1855 s1856 s1857 s1858 s1859 s1860 s1885 s1887 s1888 s1889 s1890 s1891 s1892 s1893 s1894 s1895) 0)") while checking expression at index 15
[2020-05-27 12:56:07] [INFO ] [Real]Absence check using 271 positive place invariants in 422 ms returned sat
[2020-05-27 12:56:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 12:56:15] [INFO ] [Real]Absence check using state equation in 8314 ms returned sat
[2020-05-27 12:56:16] [INFO ] Deduced a trap composed of 19 places in 1079 ms
[2020-05-27 12:56:17] [INFO ] Deduced a trap composed of 29 places in 817 ms
[2020-05-27 12:56:18] [INFO ] Deduced a trap composed of 14 places in 817 ms
[2020-05-27 12:56:19] [INFO ] Deduced a trap composed of 18 places in 814 ms
[2020-05-27 12:56:20] [INFO ] Deduced a trap composed of 22 places in 972 ms
[2020-05-27 12:56:21] [INFO ] Deduced a trap composed of 24 places in 994 ms
[2020-05-27 12:56:22] [INFO ] Deduced a trap composed of 22 places in 1016 ms
[2020-05-27 12:56:23] [INFO ] Deduced a trap composed of 32 places in 768 ms
[2020-05-27 12:56:24] [INFO ] Deduced a trap composed of 21 places in 812 ms
[2020-05-27 12:56:25] [INFO ] Deduced a trap composed of 37 places in 787 ms
[2020-05-27 12:56:26] [INFO ] Deduced a trap composed of 24 places in 902 ms
[2020-05-27 12:56:27] [INFO ] Deduced a trap composed of 17 places in 984 ms
[2020-05-27 12:56:27] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s3 s4 s5 s1689 s1690 s1691 s1692 s1697 s1698 s1699 s1725 s1732 s1733 s1734) 0)") while checking expression at index 16
[2020-05-27 12:56:27] [INFO ] [Real]Absence check using 271 positive place invariants in 272 ms returned sat
[2020-05-27 12:56:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 12:56:36] [INFO ] [Real]Absence check using state equation in 8615 ms returned sat
[2020-05-27 12:56:37] [INFO ] Deduced a trap composed of 20 places in 829 ms
[2020-05-27 12:56:38] [INFO ] Deduced a trap composed of 27 places in 837 ms
[2020-05-27 12:56:39] [INFO ] Deduced a trap composed of 35 places in 1040 ms
[2020-05-27 12:56:40] [INFO ] Deduced a trap composed of 37 places in 974 ms
[2020-05-27 12:56:41] [INFO ] Deduced a trap composed of 24 places in 917 ms
[2020-05-27 12:56:42] [INFO ] Deduced a trap composed of 22 places in 803 ms
[2020-05-27 12:56:43] [INFO ] Deduced a trap composed of 29 places in 915 ms
[2020-05-27 12:56:44] [INFO ] Deduced a trap composed of 22 places in 760 ms
[2020-05-27 12:56:45] [INFO ] Deduced a trap composed of 18 places in 738 ms
[2020-05-27 12:56:45] [INFO ] Deduced a trap composed of 17 places in 750 ms
[2020-05-27 12:56:46] [INFO ] Deduced a trap composed of 19 places in 780 ms
[2020-05-27 12:56:47] [INFO ] Deduced a trap composed of 21 places in 933 ms
[2020-05-27 12:56:47] [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 s2034 s2035 s2036 s2037 s2038 s2039 s2040 s2041 s2045 s2047 s2048 s2059 s2060 s2061 s2062 s2063 s2064 s2065 s2066 s2067) 0)") while checking expression at index 17
[2020-05-27 12:56:48] [INFO ] Flatten gal took : 201 ms
[2020-05-27 12:56:48] [INFO ] Flatten gal took : 80 ms
[2020-05-27 12:56:48] [INFO ] Applying decomposition
[2020-05-27 12:56:48] [INFO ] Flatten gal took : 73 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/graph7205524702230749902.txt, -o, /tmp/graph7205524702230749902.bin, -w, /tmp/graph7205524702230749902.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/graph7205524702230749902.bin, -l, -1, -v, -w, /tmp/graph7205524702230749902.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-27 12:56:49] [INFO ] Decomposing Gal with order
[2020-05-27 12:56:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-27 12:56:49] [INFO ] Removed a total of 180 redundant transitions.
[2020-05-27 12:56:49] [INFO ] Flatten gal took : 319 ms
[2020-05-27 12:56:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 87 ms.
[2020-05-27 12:56:49] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 56 ms
[2020-05-27 12:56:49] [INFO ] Time to serialize properties into /home/mcc/execution/CTLFireability.ctl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/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 16 CTL formulae.
built 47 ordering constraints for composite.
built 35 ordering constraints for composite.
built 38 ordering constraints for composite.
built 35 ordering constraints for composite.
built 35 ordering constraints for composite.
built 35 ordering constraints for composite.
built 35 ordering constraints for composite.
built 35 ordering constraints for composite.
built 35 ordering constraints for composite.
built 24 ordering constraints for composite.
built 25 ordering constraints for composite.
built 9 ordering constraints for composite.
built 6 ordering constraints for composite.
built 5 ordering constraints for composite.
built 10 ordering constraints for composite.
built 20 ordering constraints for composite.
built 7 ordering constraints for composite.
built 8 ordering constraints for composite.
built 7 ordering constraints for composite.
built 10 ordering constraints for composite.
built 6 ordering constraints for composite.
built 10 ordering constraints for composite.
built 35 ordering constraints for composite.
built 35 ordering constraints for composite.
built 35 ordering constraints for composite.
built 35 ordering constraints for composite.
built 35 ordering constraints for composite.
built 35 ordering constraints for composite.
built 35 ordering constraints for composite.
built 37 ordering constraints for composite.
built 38 ordering constraints for composite.
built 35 ordering constraints for composite.
built 35 ordering constraints for composite.
built 40 ordering constraints for composite.
built 35 ordering constraints for composite.
built 35 ordering constraints for composite.
built 38 ordering constraints for composite.
built 35 ordering constraints for composite.
built 41 ordering constraints for composite.
built 35 ordering constraints for composite.
built 35 ordering constraints for composite.
built 35 ordering constraints for composite.
built 33 ordering constraints for composite.
Detected timeout of ITS tools.
[2020-05-27 13:19:22] [INFO ] Applying decomposition
[2020-05-27 13:19:22] [INFO ] Flatten gal took : 332 ms
[2020-05-27 13:19:23] [INFO ] Decomposing Gal with order
[2020-05-27 13:19:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-27 13:19:24] [INFO ] Flatten gal took : 415 ms
[2020-05-27 13:19:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 11 ms.
[2020-05-27 13:19:24] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 29 ms
[2020-05-27 13:19:24] [INFO ] Time to serialize properties into /home/mcc/execution/CTLFireability.ctl : 4 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 16 CTL formulae.
built 2 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 12 ordering constraints for composite.
built 11 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 7 ordering constraints for composite.
built 12 ordering constraints for composite.
built 11 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 7 ordering constraints for composite.
built 12 ordering constraints for composite.
built 11 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 7 ordering constraints for composite.
built 12 ordering constraints for composite.
built 11 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 7 ordering constraints for composite.
built 12 ordering constraints for composite.
built 11 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 7 ordering constraints for composite.
built 12 ordering constraints for composite.
built 11 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 7 ordering constraints for composite.
built 12 ordering constraints for composite.
built 11 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 7 ordering constraints for composite.
built 12 ordering constraints for composite.
built 11 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 7 ordering constraints for composite.
built 12 ordering constraints for composite.
built 11 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 7 ordering constraints for composite.
built 12 ordering constraints for composite.
built 11 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 7 ordering constraints for composite.
built 12 ordering constraints for composite.
built 11 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 7 ordering constraints for composite.
built 12 ordering constraints for composite.
built 11 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 7 ordering constraints for composite.
built 12 ordering constraints for composite.
built 11 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 7 ordering constraints for composite.
built 12 ordering constraints for composite.
built 11 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 7 ordering constraints for composite.
built 12 ordering constraints for composite.
built 11 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 7 ordering constraints for composite.
built 12 ordering constraints for composite.
built 11 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 7 ordering constraints for composite.
built 12 ordering constraints for composite.
built 11 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 7 ordering constraints for composite.
built 12 ordering constraints for composite.
built 11 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 7 ordering constraints for composite.
built 12 ordering constraints for composite.
built 11 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 7 ordering constraints for composite.
built 12 ordering constraints for composite.
built 11 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 7 ordering constraints for composite.
built 12 ordering constraints for composite.
built 11 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 7 ordering constraints for composite.
built 12 ordering constraints for composite.
built 11 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 7 ordering constraints for composite.
built 12 ordering constraints for composite.
built 11 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 7 ordering constraints for composite.
built 12 ordering constraints for composite.
built 11 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 7 ordering constraints for composite.
built 12 ordering constraints for composite.
built 11 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 7 ordering constraints for composite.
built 12 ordering constraints for composite.
built 11 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 7 ordering constraints for composite.
built 12 ordering constraints for composite.
built 11 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 7 ordering constraints for composite.
built 12 ordering constraints for composite.
built 11 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 7 ordering constraints for composite.
built 12 ordering constraints for composite.
built 11 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 10 ordering constraints for composite.
built 9 ordering constraints for composite.
built 11 ordering constraints for composite.
built 10 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 5 ordering constraints for composite.
Detected timeout of ITS tools.
[2020-05-27 13:41:57] [INFO ] Flatten gal took : 569 ms
[2020-05-27 13:41:59] [INFO ] Input system was already deterministic with 1953 transitions.
[2020-05-27 13:41:59] [INFO ] Transformed 2103 places.
[2020-05-27 13:41:59] [INFO ] Transformed 1953 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2020-05-27 13:41:59] [INFO ] Time to serialize gal into /home/mcc/execution/CTLFireability.pnml.gal : 13 ms
[2020-05-27 13:41:59] [INFO ] Time to serialize properties into /home/mcc/execution/CTLFireability.ctl : 3 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 16 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="ShieldIIPt-PT-030B"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is ShieldIIPt-PT-030B, 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 r210-tajo-159033475600340"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPt-PT-030B.tgz
mv ShieldIIPt-PT-030B 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 '
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 ;