About the Execution of ITS-Tools for ShieldRVt-PT-040B
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15611.768 | 3600000.00 | 3660292.00 | 13760.50 | ?????????????T?? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2021-input.r235-smll-162106564800314.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2021-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ShieldRVt-PT-040B, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r235-smll-162106564800314
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 856K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 106K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 100K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Mar 28 16:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 16:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 16:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 28 16:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 27 13:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 27 13:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 25 19:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 25 19:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 08:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:52 equiv_col
-rw-r--r-- 1 mcc users 5 May 5 16:52 instance
-rw-r--r-- 1 mcc users 6 May 5 16:52 iscolored
-rw-r--r-- 1 mcc users 489K May 5 16:52 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 ShieldRVt-PT-040B-CTLFireability-00
FORMULA_NAME ShieldRVt-PT-040B-CTLFireability-01
FORMULA_NAME ShieldRVt-PT-040B-CTLFireability-02
FORMULA_NAME ShieldRVt-PT-040B-CTLFireability-03
FORMULA_NAME ShieldRVt-PT-040B-CTLFireability-04
FORMULA_NAME ShieldRVt-PT-040B-CTLFireability-05
FORMULA_NAME ShieldRVt-PT-040B-CTLFireability-06
FORMULA_NAME ShieldRVt-PT-040B-CTLFireability-07
FORMULA_NAME ShieldRVt-PT-040B-CTLFireability-08
FORMULA_NAME ShieldRVt-PT-040B-CTLFireability-09
FORMULA_NAME ShieldRVt-PT-040B-CTLFireability-10
FORMULA_NAME ShieldRVt-PT-040B-CTLFireability-11
FORMULA_NAME ShieldRVt-PT-040B-CTLFireability-12
FORMULA_NAME ShieldRVt-PT-040B-CTLFireability-13
FORMULA_NAME ShieldRVt-PT-040B-CTLFireability-14
FORMULA_NAME ShieldRVt-PT-040B-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1621275886712
Running Version 0
[2021-05-17 18:24:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-17 18:24:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 18:24:49] [INFO ] Load time of PNML (sax parser for PT used): 339 ms
[2021-05-17 18:24:49] [INFO ] Transformed 2003 places.
[2021-05-17 18:24:49] [INFO ] Transformed 2003 transitions.
[2021-05-17 18:24:49] [INFO ] Found NUPN structural information;
[2021-05-17 18:24:49] [INFO ] Parsed PT model containing 2003 places and 2003 transitions in 486 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 27 ms.
Support contains 666 out of 2003 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2003/2003 places, 2003/2003 transitions.
Discarding 227 places :
Symmetric choice reduction at 0 with 227 rule applications. Total rules 227 place count 1776 transition count 1776
Iterating global reduction 0 with 227 rules applied. Total rules applied 454 place count 1776 transition count 1776
Applied a total of 454 rules in 474 ms. Remains 1776 /2003 variables (removed 227) and now considering 1776/2003 (removed 227) transitions.
// Phase 1: matrix 1776 rows 1776 cols
[2021-05-17 18:24:50] [INFO ] Computed 161 place invariants in 55 ms
[2021-05-17 18:24:52] [INFO ] Implicit Places using invariants in 1371 ms returned []
// Phase 1: matrix 1776 rows 1776 cols
[2021-05-17 18:24:52] [INFO ] Computed 161 place invariants in 20 ms
[2021-05-17 18:24:54] [INFO ] Implicit Places using invariants and state equation in 2328 ms returned []
Implicit Place search using SMT with State Equation took 3745 ms to find 0 implicit places.
// Phase 1: matrix 1776 rows 1776 cols
[2021-05-17 18:24:54] [INFO ] Computed 161 place invariants in 13 ms
[2021-05-17 18:24:56] [INFO ] Dead Transitions using invariants and state equation in 2077 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1776/2003 places, 1776/2003 transitions.
[2021-05-17 18:24:57] [INFO ] Flatten gal took : 208 ms
[2021-05-17 18:24:57] [INFO ] Flatten gal took : 129 ms
[2021-05-17 18:24:57] [INFO ] Input system was already deterministic with 1776 transitions.
Incomplete random walk after 100000 steps, including 3 resets, run finished after 1227 ms. (steps per millisecond=81 ) properties (out of 98) seen :89
Running SMT prover for 9 properties.
// Phase 1: matrix 1776 rows 1776 cols
[2021-05-17 18:24:58] [INFO ] Computed 161 place invariants in 7 ms
[2021-05-17 18:24:59] [INFO ] [Real]Absence check using 161 positive place invariants in 100 ms returned sat
[2021-05-17 18:24:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 18:25:00] [INFO ] [Real]Absence check using state equation in 1108 ms returned sat
[2021-05-17 18:25:01] [INFO ] Deduced a trap composed of 24 places in 974 ms of which 7 ms to minimize.
[2021-05-17 18:25:02] [INFO ] Deduced a trap composed of 24 places in 881 ms of which 2 ms to minimize.
[2021-05-17 18:25:03] [INFO ] Deduced a trap composed of 43 places in 844 ms of which 3 ms to minimize.
[2021-05-17 18:25:04] [INFO ] Deduced a trap composed of 26 places in 652 ms of which 3 ms to minimize.
[2021-05-17 18:25:05] [INFO ] Deduced a trap composed of 34 places in 876 ms of which 2 ms to minimize.
[2021-05-17 18:25:06] [INFO ] Deduced a trap composed of 38 places in 828 ms of which 2 ms to minimize.
[2021-05-17 18:25:07] [INFO ] Deduced a trap composed of 36 places in 801 ms of which 3 ms to minimize.
[2021-05-17 18:25:08] [INFO ] Deduced a trap composed of 56 places in 730 ms of which 2 ms to minimize.
[2021-05-17 18:25:08] [INFO ] Deduced a trap composed of 37 places in 739 ms of which 3 ms to minimize.
[2021-05-17 18:25:09] [INFO ] Deduced a trap composed of 32 places in 889 ms of which 1 ms to minimize.
[2021-05-17 18:25:10] [INFO ] Deduced a trap composed of 32 places in 737 ms of which 2 ms to minimize.
[2021-05-17 18:25:11] [INFO ] Deduced a trap composed of 21 places in 544 ms of which 2 ms to minimize.
[2021-05-17 18:25:12] [INFO ] Deduced a trap composed of 21 places in 701 ms of which 2 ms to minimize.
[2021-05-17 18:25:13] [INFO ] Deduced a trap composed of 20 places in 831 ms of which 2 ms to minimize.
[2021-05-17 18:25:13] [INFO ] Deduced a trap composed of 40 places in 725 ms of which 1 ms to minimize.
[2021-05-17 18:25:14] [INFO ] Deduced a trap composed of 30 places in 826 ms of which 2 ms to minimize.
[2021-05-17 18:25:15] [INFO ] Deduced a trap composed of 61 places in 776 ms of which 3 ms to minimize.
[2021-05-17 18:25:16] [INFO ] Deduced a trap composed of 40 places in 528 ms of which 1 ms to minimize.
[2021-05-17 18:25:17] [INFO ] Deduced a trap composed of 32 places in 579 ms of which 1 ms to minimize.
[2021-05-17 18:25:17] [INFO ] Deduced a trap composed of 42 places in 733 ms of which 1 ms to minimize.
[2021-05-17 18:25:18] [INFO ] Deduced a trap composed of 37 places in 720 ms of which 1 ms to minimize.
[2021-05-17 18:25:19] [INFO ] Deduced a trap composed of 66 places in 516 ms of which 15 ms to minimize.
[2021-05-17 18:25:19] [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 close... while checking expression at index 0
[2021-05-17 18:25:19] [INFO ] [Real]Absence check using 161 positive place invariants in 146 ms returned sat
[2021-05-17 18:25:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 18:25:21] [INFO ] [Real]Absence check using state equation in 1220 ms returned sat
[2021-05-17 18:25:22] [INFO ] Deduced a trap composed of 29 places in 977 ms of which 2 ms to minimize.
[2021-05-17 18:25:23] [INFO ] Deduced a trap composed of 45 places in 1109 ms of which 2 ms to minimize.
[2021-05-17 18:25:24] [INFO ] Deduced a trap composed of 50 places in 798 ms of which 2 ms to minimize.
[2021-05-17 18:25:25] [INFO ] Deduced a trap composed of 52 places in 1138 ms of which 2 ms to minimize.
[2021-05-17 18:25:26] [INFO ] Deduced a trap composed of 34 places in 716 ms of which 1 ms to minimize.
[2021-05-17 18:25:27] [INFO ] Deduced a trap composed of 32 places in 759 ms of which 1 ms to minimize.
[2021-05-17 18:25:28] [INFO ] Deduced a trap composed of 41 places in 790 ms of which 1 ms to minimize.
[2021-05-17 18:25:28] [INFO ] Deduced a trap composed of 58 places in 678 ms of which 2 ms to minimize.
[2021-05-17 18:25:29] [INFO ] Deduced a trap composed of 38 places in 925 ms of which 2 ms to minimize.
[2021-05-17 18:25:30] [INFO ] Deduced a trap composed of 32 places in 703 ms of which 2 ms to minimize.
[2021-05-17 18:25:31] [INFO ] Deduced a trap composed of 41 places in 674 ms of which 2 ms to minimize.
[2021-05-17 18:25:32] [INFO ] Deduced a trap composed of 22 places in 692 ms of which 2 ms to minimize.
[2021-05-17 18:25:33] [INFO ] Deduced a trap composed of 29 places in 676 ms of which 1 ms to minimize.
[2021-05-17 18:25:34] [INFO ] Deduced a trap composed of 25 places in 779 ms of which 1 ms to minimize.
[2021-05-17 18:25:34] [INFO ] Deduced a trap composed of 55 places in 641 ms of which 1 ms to minimize.
[2021-05-17 18:25:35] [INFO ] Deduced a trap composed of 38 places in 634 ms of which 1 ms to minimize.
[2021-05-17 18:25:36] [INFO ] Deduced a trap composed of 29 places in 842 ms of which 2 ms to minimize.
[2021-05-17 18:25:37] [INFO ] Deduced a trap composed of 35 places in 739 ms of which 1 ms to minimize.
[2021-05-17 18:25:38] [INFO ] Deduced a trap composed of 38 places in 728 ms of which 2 ms to minimize.
[2021-05-17 18:25:39] [INFO ] Deduced a trap composed of 26 places in 743 ms of which 1 ms to minimize.
[2021-05-17 18:25:39] [INFO ] Deduced a trap composed of 50 places in 625 ms of which 1 ms to minimize.
[2021-05-17 18:25:39] [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 close... while checking expression at index 1
[2021-05-17 18:25:40] [INFO ] [Real]Absence check using 161 positive place invariants in 91 ms returned sat
[2021-05-17 18:25:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 18:25:41] [INFO ] [Real]Absence check using state equation in 1159 ms returned sat
[2021-05-17 18:25:42] [INFO ] Deduced a trap composed of 34 places in 765 ms of which 1 ms to minimize.
[2021-05-17 18:25:43] [INFO ] Deduced a trap composed of 21 places in 779 ms of which 2 ms to minimize.
[2021-05-17 18:25:43] [INFO ] Deduced a trap composed of 33 places in 784 ms of which 1 ms to minimize.
[2021-05-17 18:25:44] [INFO ] Deduced a trap composed of 42 places in 688 ms of which 1 ms to minimize.
[2021-05-17 18:25:45] [INFO ] Deduced a trap composed of 40 places in 630 ms of which 1 ms to minimize.
[2021-05-17 18:25:46] [INFO ] Deduced a trap composed of 27 places in 859 ms of which 2 ms to minimize.
[2021-05-17 18:25:47] [INFO ] Deduced a trap composed of 34 places in 913 ms of which 1 ms to minimize.
[2021-05-17 18:25:48] [INFO ] Deduced a trap composed of 23 places in 849 ms of which 2 ms to minimize.
[2021-05-17 18:25:49] [INFO ] Deduced a trap composed of 29 places in 882 ms of which 1 ms to minimize.
[2021-05-17 18:25:49] [INFO ] Deduced a trap composed of 22 places in 563 ms of which 1 ms to minimize.
[2021-05-17 18:25:50] [INFO ] Deduced a trap composed of 50 places in 783 ms of which 1 ms to minimize.
[2021-05-17 18:25:51] [INFO ] Deduced a trap composed of 35 places in 660 ms of which 1 ms to minimize.
[2021-05-17 18:25:52] [INFO ] Deduced a trap composed of 37 places in 807 ms of which 7 ms to minimize.
[2021-05-17 18:25:53] [INFO ] Deduced a trap composed of 27 places in 804 ms of which 1 ms to minimize.
[2021-05-17 18:25:54] [INFO ] Deduced a trap composed of 29 places in 794 ms of which 2 ms to minimize.
[2021-05-17 18:25:55] [INFO ] Deduced a trap composed of 26 places in 930 ms of which 2 ms to minimize.
[2021-05-17 18:25:56] [INFO ] Deduced a trap composed of 32 places in 844 ms of which 2 ms to minimize.
[2021-05-17 18:25:57] [INFO ] Deduced a trap composed of 29 places in 865 ms of which 2 ms to minimize.
[2021-05-17 18:25:58] [INFO ] Deduced a trap composed of 29 places in 861 ms of which 2 ms to minimize.
[2021-05-17 18:25:59] [INFO ] Deduced a trap composed of 30 places in 886 ms of which 1 ms to minimize.
[2021-05-17 18:26:00] [INFO ] Deduced a trap composed of 41 places in 919 ms of which 2 ms to minimize.
[2021-05-17 18:26:00] [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 close... while checking expression at index 2
[2021-05-17 18:26:00] [INFO ] [Real]Absence check using 161 positive place invariants in 110 ms returned sat
[2021-05-17 18:26:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 18:26:01] [INFO ] [Real]Absence check using state equation in 1286 ms returned sat
[2021-05-17 18:26:01] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 18:26:02] [INFO ] [Nat]Absence check using 161 positive place invariants in 156 ms returned sat
[2021-05-17 18:26:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 18:26:03] [INFO ] [Nat]Absence check using state equation in 1365 ms returned sat
[2021-05-17 18:26:04] [INFO ] Deduced a trap composed of 29 places in 661 ms of which 1 ms to minimize.
[2021-05-17 18:26:05] [INFO ] Deduced a trap composed of 22 places in 877 ms of which 1 ms to minimize.
[2021-05-17 18:26:06] [INFO ] Deduced a trap composed of 22 places in 800 ms of which 2 ms to minimize.
[2021-05-17 18:26:07] [INFO ] Deduced a trap composed of 33 places in 752 ms of which 2 ms to minimize.
[2021-05-17 18:26:08] [INFO ] Deduced a trap composed of 30 places in 880 ms of which 2 ms to minimize.
[2021-05-17 18:26:09] [INFO ] Deduced a trap composed of 41 places in 767 ms of which 2 ms to minimize.
[2021-05-17 18:26:10] [INFO ] Deduced a trap composed of 32 places in 748 ms of which 2 ms to minimize.
[2021-05-17 18:26:10] [INFO ] Deduced a trap composed of 23 places in 725 ms of which 2 ms to minimize.
[2021-05-17 18:26:11] [INFO ] Deduced a trap composed of 60 places in 733 ms of which 1 ms to minimize.
[2021-05-17 18:26:12] [INFO ] Deduced a trap composed of 48 places in 821 ms of which 2 ms to minimize.
[2021-05-17 18:26:13] [INFO ] Deduced a trap composed of 26 places in 790 ms of which 1 ms to minimize.
[2021-05-17 18:26:14] [INFO ] Deduced a trap composed of 41 places in 699 ms of which 1 ms to minimize.
[2021-05-17 18:26:15] [INFO ] Deduced a trap composed of 25 places in 759 ms of which 1 ms to minimize.
[2021-05-17 18:26:16] [INFO ] Deduced a trap composed of 29 places in 796 ms of which 2 ms to minimize.
[2021-05-17 18:26:17] [INFO ] Deduced a trap composed of 25 places in 756 ms of which 1 ms to minimize.
[2021-05-17 18:26:18] [INFO ] Deduced a trap composed of 23 places in 750 ms of which 1 ms to minimize.
[2021-05-17 18:26:18] [INFO ] Deduced a trap composed of 36 places in 758 ms of which 2 ms to minimize.
[2021-05-17 18:26:19] [INFO ] Deduced a trap composed of 25 places in 623 ms of which 2 ms to minimize.
[2021-05-17 18:26:20] [INFO ] Deduced a trap composed of 38 places in 676 ms of which 2 ms to minimize.
[2021-05-17 18:26:21] [INFO ] Deduced a trap composed of 41 places in 757 ms of which 1 ms to minimize.
[2021-05-17 18:26:21] [INFO ] Deduced a trap composed of 41 places in 677 ms of which 1 ms to minimize.
[2021-05-17 18:26:21] [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 close... while checking expression at index 3
[2021-05-17 18:26:22] [INFO ] [Real]Absence check using 161 positive place invariants in 160 ms returned sat
[2021-05-17 18:26:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 18:26:23] [INFO ] [Real]Absence check using state equation in 1459 ms returned sat
[2021-05-17 18:26:24] [INFO ] Deduced a trap composed of 21 places in 882 ms of which 1 ms to minimize.
[2021-05-17 18:26:26] [INFO ] Deduced a trap composed of 24 places in 1062 ms of which 2 ms to minimize.
[2021-05-17 18:26:27] [INFO ] Deduced a trap composed of 34 places in 1107 ms of which 2 ms to minimize.
[2021-05-17 18:26:28] [INFO ] Deduced a trap composed of 26 places in 1058 ms of which 2 ms to minimize.
[2021-05-17 18:26:29] [INFO ] Deduced a trap composed of 42 places in 978 ms of which 1 ms to minimize.
[2021-05-17 18:26:30] [INFO ] Deduced a trap composed of 27 places in 1090 ms of which 2 ms to minimize.
[2021-05-17 18:26:31] [INFO ] Deduced a trap composed of 26 places in 1037 ms of which 2 ms to minimize.
[2021-05-17 18:26:32] [INFO ] Deduced a trap composed of 27 places in 933 ms of which 1 ms to minimize.
[2021-05-17 18:26:33] [INFO ] Deduced a trap composed of 50 places in 921 ms of which 2 ms to minimize.
[2021-05-17 18:26:35] [INFO ] Deduced a trap composed of 44 places in 942 ms of which 2 ms to minimize.
[2021-05-17 18:26:36] [INFO ] Deduced a trap composed of 29 places in 920 ms of which 2 ms to minimize.
[2021-05-17 18:26:36] [INFO ] Deduced a trap composed of 32 places in 871 ms of which 1 ms to minimize.
[2021-05-17 18:26:38] [INFO ] Deduced a trap composed of 30 places in 929 ms of which 2 ms to minimize.
[2021-05-17 18:26:38] [INFO ] Deduced a trap composed of 29 places in 842 ms of which 1 ms to minimize.
[2021-05-17 18:26:39] [INFO ] Deduced a trap composed of 25 places in 826 ms of which 2 ms to minimize.
[2021-05-17 18:26:40] [INFO ] Deduced a trap composed of 46 places in 813 ms of which 1 ms to minimize.
[2021-05-17 18:26:41] [INFO ] Deduced a trap composed of 45 places in 708 ms of which 1 ms to minimize.
[2021-05-17 18:26:42] [INFO ] Deduced a trap composed of 44 places in 869 ms of which 2 ms to minimize.
[2021-05-17 18:26:42] [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 close... while checking expression at index 4
[2021-05-17 18:26:43] [INFO ] [Real]Absence check using 161 positive place invariants in 156 ms returned sat
[2021-05-17 18:26:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 18:26:44] [INFO ] [Real]Absence check using state equation in 1557 ms returned sat
[2021-05-17 18:26:45] [INFO ] Deduced a trap composed of 42 places in 866 ms of which 1 ms to minimize.
[2021-05-17 18:26:46] [INFO ] Deduced a trap composed of 28 places in 868 ms of which 2 ms to minimize.
[2021-05-17 18:26:47] [INFO ] Deduced a trap composed of 36 places in 985 ms of which 1 ms to minimize.
[2021-05-17 18:26:48] [INFO ] Deduced a trap composed of 38 places in 580 ms of which 1 ms to minimize.
[2021-05-17 18:26:49] [INFO ] Deduced a trap composed of 31 places in 749 ms of which 1 ms to minimize.
[2021-05-17 18:26:50] [INFO ] Deduced a trap composed of 27 places in 885 ms of which 2 ms to minimize.
[2021-05-17 18:26:51] [INFO ] Deduced a trap composed of 36 places in 919 ms of which 1 ms to minimize.
[2021-05-17 18:26:52] [INFO ] Deduced a trap composed of 51 places in 760 ms of which 1 ms to minimize.
[2021-05-17 18:26:52] [INFO ] Deduced a trap composed of 45 places in 744 ms of which 1 ms to minimize.
[2021-05-17 18:26:53] [INFO ] Deduced a trap composed of 44 places in 802 ms of which 1 ms to minimize.
[2021-05-17 18:26:54] [INFO ] Deduced a trap composed of 32 places in 716 ms of which 1 ms to minimize.
[2021-05-17 18:26:55] [INFO ] Deduced a trap composed of 24 places in 670 ms of which 1 ms to minimize.
[2021-05-17 18:26:56] [INFO ] Deduced a trap composed of 25 places in 758 ms of which 2 ms to minimize.
[2021-05-17 18:26:57] [INFO ] Deduced a trap composed of 25 places in 800 ms of which 1 ms to minimize.
[2021-05-17 18:26:58] [INFO ] Deduced a trap composed of 21 places in 952 ms of which 2 ms to minimize.
[2021-05-17 18:26:59] [INFO ] Deduced a trap composed of 48 places in 890 ms of which 1 ms to minimize.
[2021-05-17 18:27:00] [INFO ] Deduced a trap composed of 36 places in 743 ms of which 2 ms to minimize.
[2021-05-17 18:27:01] [INFO ] Deduced a trap composed of 29 places in 945 ms of which 2 ms to minimize.
[2021-05-17 18:27:01] [INFO ] Deduced a trap composed of 36 places in 707 ms of which 2 ms to minimize.
[2021-05-17 18:27:02] [INFO ] Deduced a trap composed of 34 places in 844 ms of which 2 ms to minimize.
[2021-05-17 18:27:02] [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 close... while checking expression at index 5
[2021-05-17 18:27:03] [INFO ] [Real]Absence check using 161 positive place invariants in 107 ms returned sat
[2021-05-17 18:27:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 18:27:04] [INFO ] [Real]Absence check using state equation in 1505 ms returned sat
[2021-05-17 18:27:05] [INFO ] Deduced a trap composed of 21 places in 899 ms of which 2 ms to minimize.
[2021-05-17 18:27:06] [INFO ] Deduced a trap composed of 26 places in 871 ms of which 2 ms to minimize.
[2021-05-17 18:27:08] [INFO ] Deduced a trap composed of 21 places in 978 ms of which 2 ms to minimize.
[2021-05-17 18:27:09] [INFO ] Deduced a trap composed of 39 places in 1105 ms of which 2 ms to minimize.
[2021-05-17 18:27:10] [INFO ] Deduced a trap composed of 39 places in 961 ms of which 1 ms to minimize.
[2021-05-17 18:27:11] [INFO ] Deduced a trap composed of 23 places in 827 ms of which 1 ms to minimize.
[2021-05-17 18:27:12] [INFO ] Deduced a trap composed of 36 places in 971 ms of which 1 ms to minimize.
[2021-05-17 18:27:13] [INFO ] Deduced a trap composed of 34 places in 696 ms of which 2 ms to minimize.
[2021-05-17 18:27:13] [INFO ] Deduced a trap composed of 26 places in 790 ms of which 1 ms to minimize.
[2021-05-17 18:27:14] [INFO ] Deduced a trap composed of 25 places in 855 ms of which 2 ms to minimize.
[2021-05-17 18:27:15] [INFO ] Deduced a trap composed of 26 places in 992 ms of which 2 ms to minimize.
[2021-05-17 18:27:16] [INFO ] Deduced a trap composed of 27 places in 944 ms of which 2 ms to minimize.
[2021-05-17 18:27:18] [INFO ] Deduced a trap composed of 28 places in 962 ms of which 2 ms to minimize.
[2021-05-17 18:27:19] [INFO ] Deduced a trap composed of 48 places in 890 ms of which 2 ms to minimize.
[2021-05-17 18:27:20] [INFO ] Deduced a trap composed of 32 places in 877 ms of which 2 ms to minimize.
[2021-05-17 18:27:21] [INFO ] Deduced a trap composed of 33 places in 930 ms of which 2 ms to minimize.
[2021-05-17 18:27:21] [INFO ] Deduced a trap composed of 40 places in 837 ms of which 2 ms to minimize.
[2021-05-17 18:27:22] [INFO ] Deduced a trap composed of 41 places in 620 ms of which 2 ms to minimize.
[2021-05-17 18:27:23] [INFO ] Deduced a trap composed of 38 places in 891 ms of which 2 ms to minimize.
[2021-05-17 18:27:23] [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 close... while checking expression at index 6
[2021-05-17 18:27:24] [INFO ] [Real]Absence check using 161 positive place invariants in 125 ms returned sat
[2021-05-17 18:27:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 18:27:25] [INFO ] [Real]Absence check using state equation in 1329 ms returned sat
[2021-05-17 18:27:25] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 18:27:26] [INFO ] [Nat]Absence check using 161 positive place invariants in 150 ms returned sat
[2021-05-17 18:27:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 18:27:27] [INFO ] [Nat]Absence check using state equation in 1300 ms returned sat
[2021-05-17 18:27:28] [INFO ] Deduced a trap composed of 22 places in 1145 ms of which 2 ms to minimize.
[2021-05-17 18:27:29] [INFO ] Deduced a trap composed of 40 places in 1115 ms of which 2 ms to minimize.
[2021-05-17 18:27:31] [INFO ] Deduced a trap composed of 42 places in 1062 ms of which 2 ms to minimize.
[2021-05-17 18:27:32] [INFO ] Deduced a trap composed of 33 places in 1050 ms of which 1 ms to minimize.
[2021-05-17 18:27:33] [INFO ] Deduced a trap composed of 26 places in 972 ms of which 2 ms to minimize.
[2021-05-17 18:27:34] [INFO ] Deduced a trap composed of 37 places in 989 ms of which 2 ms to minimize.
[2021-05-17 18:27:35] [INFO ] Deduced a trap composed of 21 places in 779 ms of which 2 ms to minimize.
[2021-05-17 18:27:36] [INFO ] Deduced a trap composed of 33 places in 997 ms of which 1 ms to minimize.
[2021-05-17 18:27:37] [INFO ] Deduced a trap composed of 37 places in 720 ms of which 1 ms to minimize.
[2021-05-17 18:27:37] [INFO ] Deduced a trap composed of 33 places in 863 ms of which 1 ms to minimize.
[2021-05-17 18:27:38] [INFO ] Deduced a trap composed of 36 places in 904 ms of which 2 ms to minimize.
[2021-05-17 18:27:40] [INFO ] Deduced a trap composed of 44 places in 989 ms of which 2 ms to minimize.
[2021-05-17 18:27:40] [INFO ] Deduced a trap composed of 29 places in 739 ms of which 2 ms to minimize.
[2021-05-17 18:27:41] [INFO ] Deduced a trap composed of 25 places in 892 ms of which 2 ms to minimize.
[2021-05-17 18:27:42] [INFO ] Deduced a trap composed of 66 places in 651 ms of which 2 ms to minimize.
[2021-05-17 18:27:43] [INFO ] Deduced a trap composed of 43 places in 741 ms of which 1 ms to minimize.
[2021-05-17 18:27:44] [INFO ] Deduced a trap composed of 44 places in 805 ms of which 2 ms to minimize.
[2021-05-17 18:27:45] [INFO ] Deduced a trap composed of 46 places in 951 ms of which 2 ms to minimize.
[2021-05-17 18:27:46] [INFO ] Deduced a trap composed of 35 places in 704 ms of which 2 ms to minimize.
[2021-05-17 18:27: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 close... while checking expression at index 7
[2021-05-17 18:27:46] [INFO ] [Real]Absence check using 161 positive place invariants in 145 ms returned sat
[2021-05-17 18:27:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 18:27:47] [INFO ] [Real]Absence check using state equation in 1186 ms returned sat
[2021-05-17 18:27:48] [INFO ] Deduced a trap composed of 28 places in 918 ms of which 1 ms to minimize.
[2021-05-17 18:27:49] [INFO ] Deduced a trap composed of 46 places in 849 ms of which 2 ms to minimize.
[2021-05-17 18:27:50] [INFO ] Deduced a trap composed of 52 places in 997 ms of which 2 ms to minimize.
[2021-05-17 18:27:51] [INFO ] Deduced a trap composed of 27 places in 871 ms of which 2 ms to minimize.
[2021-05-17 18:27:52] [INFO ] Deduced a trap composed of 41 places in 760 ms of which 1 ms to minimize.
[2021-05-17 18:27:53] [INFO ] Deduced a trap composed of 33 places in 681 ms of which 5 ms to minimize.
[2021-05-17 18:27:54] [INFO ] Deduced a trap composed of 29 places in 756 ms of which 2 ms to minimize.
[2021-05-17 18:27:55] [INFO ] Deduced a trap composed of 29 places in 634 ms of which 2 ms to minimize.
[2021-05-17 18:27:55] [INFO ] Deduced a trap composed of 26 places in 721 ms of which 1 ms to minimize.
[2021-05-17 18:27:56] [INFO ] Deduced a trap composed of 35 places in 793 ms of which 2 ms to minimize.
[2021-05-17 18:27:57] [INFO ] Deduced a trap composed of 23 places in 711 ms of which 2 ms to minimize.
[2021-05-17 18:27:58] [INFO ] Deduced a trap composed of 21 places in 705 ms of which 1 ms to minimize.
[2021-05-17 18:27:59] [INFO ] Deduced a trap composed of 23 places in 923 ms of which 2 ms to minimize.
[2021-05-17 18:28:00] [INFO ] Deduced a trap composed of 29 places in 811 ms of which 1 ms to minimize.
[2021-05-17 18:28:01] [INFO ] Deduced a trap composed of 22 places in 663 ms of which 2 ms to minimize.
[2021-05-17 18:28:01] [INFO ] Deduced a trap composed of 29 places in 636 ms of which 1 ms to minimize.
[2021-05-17 18:28:02] [INFO ] Deduced a trap composed of 34 places in 641 ms of which 2 ms to minimize.
[2021-05-17 18:28:03] [INFO ] Deduced a trap composed of 23 places in 596 ms of which 2 ms to minimize.
[2021-05-17 18:28:04] [INFO ] Deduced a trap composed of 47 places in 746 ms of which 2 ms to minimize.
[2021-05-17 18:28:05] [INFO ] Deduced a trap composed of 37 places in 792 ms of which 2 ms to minimize.
[2021-05-17 18:28:05] [INFO ] Deduced a trap composed of 35 places in 560 ms of which 1 ms to minimize.
[2021-05-17 18:28:06] [INFO ] Deduced a trap composed of 34 places in 623 ms of which 1 ms to minimize.
[2021-05-17 18:28: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 close... while checking expression at index 8
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 447 transitions
Trivial Post-agglo rules discarded 447 transitions
Performed 447 trivial Post agglomeration. Transition count delta: 447
Iterating post reduction 0 with 447 rules applied. Total rules applied 447 place count 1775 transition count 1328
Reduce places removed 447 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 449 rules applied. Total rules applied 896 place count 1328 transition count 1326
Reduce places removed 1 places and 0 transitions.
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Iterating post reduction 2 with 16 rules applied. Total rules applied 912 place count 1327 transition count 1311
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 3 with 15 rules applied. Total rules applied 927 place count 1312 transition count 1311
Performed 221 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 221 Pre rules applied. Total rules applied 927 place count 1312 transition count 1090
Deduced a syphon composed of 221 places in 11 ms
Reduce places removed 221 places and 0 transitions.
Iterating global reduction 4 with 442 rules applied. Total rules applied 1369 place count 1091 transition count 1090
Discarding 143 places :
Symmetric choice reduction at 4 with 143 rule applications. Total rules 1512 place count 948 transition count 947
Iterating global reduction 4 with 143 rules applied. Total rules applied 1655 place count 948 transition count 947
Performed 91 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 91 Pre rules applied. Total rules applied 1655 place count 948 transition count 856
Deduced a syphon composed of 91 places in 8 ms
Reduce places removed 91 places and 0 transitions.
Iterating global reduction 4 with 182 rules applied. Total rules applied 1837 place count 857 transition count 856
Performed 330 Post agglomeration using F-continuation condition.Transition count delta: 330
Deduced a syphon composed of 330 places in 5 ms
Reduce places removed 330 places and 0 transitions.
Iterating global reduction 4 with 660 rules applied. Total rules applied 2497 place count 527 transition count 526
Renaming transitions due to excessive name length > 1024 char.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -86
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 2699 place count 426 transition count 612
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 2707 place count 422 transition count 614
Partial Post-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 2710 place count 422 transition count 614
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 2711 place count 421 transition count 613
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2712 place count 420 transition count 613
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 2713 place count 419 transition count 612
Applied a total of 2713 rules in 810 ms. Remains 419 /1776 variables (removed 1357) and now considering 612/1776 (removed 1164) transitions.
[2021-05-17 18:28:07] [INFO ] Flatten gal took : 75 ms
[2021-05-17 18:28:07] [INFO ] Flatten gal took : 68 ms
[2021-05-17 18:28:07] [INFO ] Input system was already deterministic with 612 transitions.
[2021-05-17 18:28:07] [INFO ] Flatten gal took : 42 ms
[2021-05-17 18:28:07] [INFO ] Flatten gal took : 41 ms
[2021-05-17 18:28:07] [INFO ] Time to serialize gal into /tmp/CTLFireability4006809472222048036.gal : 16 ms
[2021-05-17 18:28:07] [INFO ] Time to serialize properties into /tmp/CTLFireability5472339302891533708.ctl : 2 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability4006809472222048036.gal, -t, CGAL, -ctl, /tmp/CTLFireability5472339302891533708.ctl, --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.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability4006809472222048036.gal -t CGAL -ctl /tmp/CTLFireability5472339302891533708.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.71084e+60,0.796257,21352,2,2491,5,66054,6,0,2280,86070,0
Converting to forward existential form...Done !
original formula: EF(((((((((((p830==0)&&(p369==0))&&(p904==0))&&(p886==0))&&(p1149==0))&&((p1683==0)||(p1702==0)))&&((((((p210==1)||(p369==1))||(p934==1))||(p1198==1))||(p883==1))||(p488==1)))&&((((p991==1)||(p1762==1))||(p314==1))||(p1355==1))) * (!(EG((((((((p1478==0)&&(p114==0))&&(((p595==0)||(p601==0))||(p617==0)))&&(p1084==0))&&(((p1205==0)||(p1217==0))||(p1249==0)))&&(p1135==0))&&((p66==0)||(p85==0))))) + (((((((((((((((((p730==0)&&(p1588==0))&&(p1600==0))&&(p1650==0))&&(p518==0))&&(p615==0))&&(p1638==0))&&(p1916==0))&&(p750==0))&&(p952==0))&&(p1421==0))&&(p170==0))&&(p1873==0))&&(p381==0))&&(p880==0))&&(p488==0))&&((p40==0)||(p73==0))))) * (AF(((((((((p1153==1)||(p1768==1))||(p1587==1))||(p1456==1))||(p197==1))||(p576==1))||(p1827==1))||(p800==1))) + (((((((((((p537==0)&&(p1248==0))&&(p35==0))&&(p749==0))&&(p1278==0))&&(p211==0))&&(p892==0))&&(p1090==0))&&(p101==0))&&(p1422==0))&&((p654==0)||(p673==0))))))
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * (((((((((p830==0)&&(p369==0))&&(p904==0))&&(p886==0))&&(p1149==0))&&((p1683==0)||(p1702==0)))&&((((((p210==1)||(p369==1))||(p934==1))||(p1198==1))||(p883==1))||(p488==1)))&&((((p991==1)||(p1762==1))||(p314==1))||(p1355==1))) * (!(EG((((((((p1478==0)&&(p114==0))&&(((p595==0)||(p601==0))||(p617==0)))&&(p1084==0))&&(((p1205==0)||(p1217==0))||(p1249==0)))&&(p1135==0))&&((p66==0)||(p85==0))))) + (((((((((((((((((p730==0)&&(p1588==0))&&(p1600==0))&&(p1650==0))&&(p518==0))&&(p615==0))&&(p1638==0))&&(p1916==0))&&(p750==0))&&(p952==0))&&(p1421==0))&&(p170==0))&&(p1873==0))&&(p381==0))&&(p880==0))&&(p488==0))&&((p40==0)||(p73==0)))))) * !(EG(!(((((((((p1153==1)||(p1768==1))||(p1587==1))||(p1456==1))||(p197==1))||(p576==1))||(p1827==1))||(p800==1))))))] != FALSE + [((FwdU(Init,TRUE) * (((((((((p830==0)&&(p369==0))&&(p904==0))&&(p886==0))&&(p1149==0))&&((p1683==0)||(p1702==0)))&&((((((p210==1)||(p369==1))||(p934==1))||(p1198==1))||(p883==1))||(p488==1)))&&((((p991==1)||(p1762==1))||(p314==1))||(p1355==1))) * (!(EG((((((((p1478==0)&&(p114==0))&&(((p595==0)||(p601==0))||(p617==0)))&&(p1084==0))&&(((p1205==0)||(p1217==0))||(p1249==0)))&&(p1135==0))&&((p66==0)||(p85==0))))) + (((((((((((((((((p730==0)&&(p1588==0))&&(p1600==0))&&(p1650==0))&&(p518==0))&&(p615==0))&&(p1638==0))&&(p1916==0))&&(p750==0))&&(p952==0))&&(p1421==0))&&(p170==0))&&(p1873==0))&&(p381==0))&&(p880==0))&&(p488==0))&&((p40==0)||(p73==0)))))) * (((((((((((p537==0)&&(p1248==0))&&(p35==0))&&(p749==0))&&(p1278==0))&&(p211==0))&&(p892==0))&&(p1090==0))&&(p101==0))&&(p1422==0))&&((p654==0)||(p673==0))))] != FALSE)
Reverse transition relation is NOT exact ! Due to transitions t6, t7, t8, t9, t10, t11, t13, t14, t16, t17, t18, t19, t21, t23, t28, t36, t40, t41, t42, t46, t49, t51, t53, t55, t58, t59, t68, t90, t94, t98, t99, t101, t103, t105, t106, t110, t112, t114, t116, t118, t119, t121, t123, t124, t127, t129, t131, t133, t134, t136, t137, t138, t139, t141, t143, t147, t149, t151, t153, t155, t157, t159, t162, t166, t168, t170, t172, t192, t200, t212, t216, t220, t224, t228, t232, t236, t244, t248, t252, t256, t257, t258, t264, t268, t272, t275, t280, t282, t285, t286, t290, t296, t302, t311, t315, t319, t321, t328, t332, t336, t338, t342, t348, t352, t355, t359, t364, t368, t372, t377, t378, t383, t388, t392, t396, t399, t404, t406, t409, t410, t420, t427, t436, t440, t444, t448, t456, t460, t464, t468, t472, t473, t474, t475, t476, t480, t487, t492, t499, t504, t508, t512, t516, t520, t529, t530, t531, t532, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/464/148/612
Detected timeout of ITS tools.
[2021-05-17 18:28:37] [INFO ] Flatten gal took : 57 ms
[2021-05-17 18:28:37] [INFO ] Applying decomposition
[2021-05-17 18:28:38] [INFO ] Flatten gal took : 79 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph10151697672864089382.txt, -o, /tmp/graph10151697672864089382.bin, -w, /tmp/graph10151697672864089382.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph10151697672864089382.bin, -l, -1, -v, -w, /tmp/graph10151697672864089382.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 18:28:38] [INFO ] Decomposing Gal with order
[2021-05-17 18:28:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 18:28:38] [INFO ] Removed a total of 888 redundant transitions.
[2021-05-17 18:28:38] [INFO ] Flatten gal took : 180 ms
[2021-05-17 18:28:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 352 labels/synchronizations in 47 ms.
[2021-05-17 18:28:38] [INFO ] Time to serialize gal into /tmp/CTLFireability6848936548342333723.gal : 13 ms
[2021-05-17 18:28:38] [INFO ] Time to serialize properties into /tmp/CTLFireability10765842562934328682.ctl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability6848936548342333723.gal, -t, CGAL, -ctl, /tmp/CTLFireability10765842562934328682.ctl], workingDir=/home/mcc/execution]
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability6848936548342333723.gal -t CGAL -ctl /tmp/CTLFireability10765842562934328682.ctl
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.71084e+60,1.37052,39444,858,166,75236,1627,807,154509,195,5399,0
Converting to forward existential form...Done !
original formula: EF(((((((((((i5.i0.i1.u62.p830==0)&&(i1.u24.p369==0))&&(i5.i0.i1.u70.p904==0))&&(i5.i1.i0.u68.p886==0))&&(i7.u89.p1149==0))&&((i11.u132.p1683==0)||(i11.u134.p1702==0)))&&((((((i1.u11.p210==1)||(i1.u24.p369==1))||(i6.u73.p934==1))||(i8.u92.p1198==1))||(i5.i1.i0.u67.p883==1))||(i2.u33.p488==1)))&&((((i6.u77.p991==1)||(i12.u139.p1762==1))||(i1.u21.p314==1))||(i9.u105.p1355==1))) * (!(EG((((((((i10.u114.p1478==0)&&(i1.u5.p114==0))&&(((i3.u40.p595==0)||(i3.u41.p601==0))||(i3.u42.p617==0)))&&(i7.u84.p1084==0))&&(((i8.u92.p1205==0)||(i8.u93.p1217==0))||(i8.u96.p1249==0)))&&(i7.u88.p1135==0))&&((i0.u2.p66==0)||(i0.u2.p85==0))))) + (((((((((((((((((i4.u52.p730==0)&&(i10.u125.p1588==0))&&(i10.u127.p1600==0))&&(i11.u130.p1650==0))&&(i2.u34.p518==0))&&(i3.u42.p615==0))&&(i11.u129.p1638==0))&&(i13.u150.p1916==0))&&(i4.u55.p750==0))&&(i6.u74.p952==0))&&(i10.u110.p1421==0))&&(i1.u8.p170==0))&&(i12.u147.p1873==0))&&(i2.u25.p381==0))&&(i5.i1.i0.u67.p880==0))&&(i2.u33.p488==0))&&((i0.u1.p40==0)||(i0.u2.p73==0))))) * (AF(((((((((i7.u89.p1153==1)||(i12.u139.p1768==1))||(i10.u124.p1587==1))||(i10.u112.p1456==1))||(i1.u10.p197==1))||(i3.u39.p576==1))||(i12.u143.p1827==1))||(i5.i0.i0.u59.p800==1))) + (((((((((((i3.u36.p537==0)&&(i8.u97.p1248==0))&&(i1.u0.p35==0))&&(i4.u54.p749==0))&&(i9.u99.p1278==0))&&(i1.u12.p211==0))&&(i5.i1.i1.u69.p892==0))&&(i7.u85.p1090==0))&&(i1.u4.p101==0))&&(i10.u110.p1422==0))&&((i4.u45.p654==0)||(i4.u47.p673==0))))))
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * (((((((((i5.i0.i1.u62.p830==0)&&(i1.u24.p369==0))&&(i5.i0.i1.u70.p904==0))&&(i5.i1.i0.u68.p886==0))&&(i7.u89.p1149==0))&&((i11.u132.p1683==0)||(i11.u134.p1702==0)))&&((((((i1.u11.p210==1)||(i1.u24.p369==1))||(i6.u73.p934==1))||(i8.u92.p1198==1))||(i5.i1.i0.u67.p883==1))||(i2.u33.p488==1)))&&((((i6.u77.p991==1)||(i12.u139.p1762==1))||(i1.u21.p314==1))||(i9.u105.p1355==1))) * (!(EG((((((((i10.u114.p1478==0)&&(i1.u5.p114==0))&&(((i3.u40.p595==0)||(i3.u41.p601==0))||(i3.u42.p617==0)))&&(i7.u84.p1084==0))&&(((i8.u92.p1205==0)||(i8.u93.p1217==0))||(i8.u96.p1249==0)))&&(i7.u88.p1135==0))&&((i0.u2.p66==0)||(i0.u2.p85==0))))) + (((((((((((((((((i4.u52.p730==0)&&(i10.u125.p1588==0))&&(i10.u127.p1600==0))&&(i11.u130.p1650==0))&&(i2.u34.p518==0))&&(i3.u42.p615==0))&&(i11.u129.p1638==0))&&(i13.u150.p1916==0))&&(i4.u55.p750==0))&&(i6.u74.p952==0))&&(i10.u110.p1421==0))&&(i1.u8.p170==0))&&(i12.u147.p1873==0))&&(i2.u25.p381==0))&&(i5.i1.i0.u67.p880==0))&&(i2.u33.p488==0))&&((i0.u1.p40==0)||(i0.u2.p73==0)))))) * !(EG(!(((((((((i7.u89.p1153==1)||(i12.u139.p1768==1))||(i10.u124.p1587==1))||(i10.u112.p1456==1))||(i1.u10.p197==1))||(i3.u39.p576==1))||(i12.u143.p1827==1))||(i5.i0.i0.u59.p800==1))))))] != FALSE + [((FwdU(Init,TRUE) * (((((((((i5.i0.i1.u62.p830==0)&&(i1.u24.p369==0))&&(i5.i0.i1.u70.p904==0))&&(i5.i1.i0.u68.p886==0))&&(i7.u89.p1149==0))&&((i11.u132.p1683==0)||(i11.u134.p1702==0)))&&((((((i1.u11.p210==1)||(i1.u24.p369==1))||(i6.u73.p934==1))||(i8.u92.p1198==1))||(i5.i1.i0.u67.p883==1))||(i2.u33.p488==1)))&&((((i6.u77.p991==1)||(i12.u139.p1762==1))||(i1.u21.p314==1))||(i9.u105.p1355==1))) * (!(EG((((((((i10.u114.p1478==0)&&(i1.u5.p114==0))&&(((i3.u40.p595==0)||(i3.u41.p601==0))||(i3.u42.p617==0)))&&(i7.u84.p1084==0))&&(((i8.u92.p1205==0)||(i8.u93.p1217==0))||(i8.u96.p1249==0)))&&(i7.u88.p1135==0))&&((i0.u2.p66==0)||(i0.u2.p85==0))))) + (((((((((((((((((i4.u52.p730==0)&&(i10.u125.p1588==0))&&(i10.u127.p1600==0))&&(i11.u130.p1650==0))&&(i2.u34.p518==0))&&(i3.u42.p615==0))&&(i11.u129.p1638==0))&&(i13.u150.p1916==0))&&(i4.u55.p750==0))&&(i6.u74.p952==0))&&(i10.u110.p1421==0))&&(i1.u8.p170==0))&&(i12.u147.p1873==0))&&(i2.u25.p381==0))&&(i5.i1.i0.u67.p880==0))&&(i2.u33.p488==0))&&((i0.u1.p40==0)||(i0.u2.p73==0)))))) * (((((((((((i3.u36.p537==0)&&(i8.u97.p1248==0))&&(i1.u0.p35==0))&&(i4.u54.p749==0))&&(i9.u99.p1278==0))&&(i1.u12.p211==0))&&(i5.i1.i1.u69.p892==0))&&(i7.u85.p1090==0))&&(i1.u4.p101==0))&&(i10.u110.p1422==0))&&((i4.u45.p654==0)||(i4.u47.p673==0))))] != FALSE)
Reverse transition relation is NOT exact ! Due to transitions t106, t258, t319, t347, t354, t405, t434, t448, t480, i0.t99, i0.u1.t46, i0.u2.t98, i0.u2.t192, i0.u2.t200, i1.t254, i1.t250, i1.t245, i1.t244, i1.t234, i1.t231, i1.t225, i1.t222, i1.t218, i1.t216, i1.t211, i1.t110, i1.t105, i1.t102, i1.u3.t90, i1.u5.t101, i1.u8.t42, i1.u10.t41, i1.u12.t40, i1.u21.t49, i1.u24.t36, i2.t293, i2.t289, i2.t284, i2.t280, i2.t276, i2.t271, i2.t267, i2.t263, i2.t117, i2.t115, i2.t113, i2.u25.t51, i2.u25.t112, i2.u33.t53, i2.u34.t285, i2.u34.t286, i3.t311, i3.t302, i3.t121, i3.u36.t119, i3.u38.t68, i3.u42.t123, i3.u43.t124, i4.t342, i4.t338, i4.t334, i4.t332, i4.t327, i4.t322, i4.t315, i4.t131, i4.t129, i4.t126, i4.u55.t28, i5.i0.t358, i5.i0.t367, i5.i0.i0.t351, i5.i0.i0.u59.t133, i5.i0.i1.t370, i5.i0.i1.t363, i5.i0.i1.t137, i5.i0.i1.t136, i5.i0.i1.t134, i5.i0.i1.u70.t21, i5.i1.i0.t138, i5.i1.i0.u67.t23, i5.i1.i0.u67.t139, i5.i1.i1.t140, i5.i1.i1.u69.t55, i6.t401, i6.t397, i6.t395, i6.t389, i6.t386, i6.t381, i6.t147, i6.u72.t94, i6.u74.t377, i6.u74.t378, i6.u75.t143, i6.u77.t19, i7.t427, i7.t417, i7.t148, i7.u84.t409, i7.u84.t410, i7.u85.t18, i7.u88.t17, i7.u89.t16, i7.u90.t151, i8.t444, i8.t440, i8.t155, i8.u92.t14, i8.u93.t153, i8.u97.t13, i9.t473, i9.t469, i9.t467, i9.t461, i9.t458, i9.t454, i9.t161, i9.t159, i9.u99.t11, i9.u101.t157, i9.u105.t10, i10.t519, i10.t515, i10.t510, i10.t508, i10.t503, i10.t500, i10.t490, i10.t488, i10.t171, i10.t170, i10.t168, i10.t165, i10.t6, i10.u110.t8, i10.u110.t9, i10.u112.t7, i10.u125.t58, i10.u127.t59, i11.u129.t529, i11.u129.t530, i11.u130.t531, i11.u130.t532, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/158/144/302
Detected timeout of ITS tools.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 472 transitions
Trivial Post-agglo rules discarded 472 transitions
Performed 472 trivial Post agglomeration. Transition count delta: 472
Iterating post reduction 0 with 472 rules applied. Total rules applied 472 place count 1775 transition count 1303
Reduce places removed 472 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 482 rules applied. Total rules applied 954 place count 1303 transition count 1293
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 964 place count 1293 transition count 1293
Performed 217 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 217 Pre rules applied. Total rules applied 964 place count 1293 transition count 1076
Deduced a syphon composed of 217 places in 3 ms
Reduce places removed 217 places and 0 transitions.
Iterating global reduction 3 with 434 rules applied. Total rules applied 1398 place count 1076 transition count 1076
Discarding 148 places :
Symmetric choice reduction at 3 with 148 rule applications. Total rules 1546 place count 928 transition count 928
Iterating global reduction 3 with 148 rules applied. Total rules applied 1694 place count 928 transition count 928
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 101 Pre rules applied. Total rules applied 1694 place count 928 transition count 827
Deduced a syphon composed of 101 places in 2 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 1896 place count 827 transition count 827
Performed 344 Post agglomeration using F-continuation condition.Transition count delta: 344
Deduced a syphon composed of 344 places in 1 ms
Reduce places removed 344 places and 0 transitions.
Iterating global reduction 3 with 688 rules applied. Total rules applied 2584 place count 483 transition count 483
Renaming transitions due to excessive name length > 1024 char.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -97
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 2786 place count 382 transition count 580
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 2814 place count 368 transition count 593
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 2815 place count 367 transition count 592
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 2816 place count 366 transition count 591
Applied a total of 2816 rules in 540 ms. Remains 366 /1776 variables (removed 1410) and now considering 591/1776 (removed 1185) transitions.
[2021-05-17 18:29:09] [INFO ] Flatten gal took : 63 ms
[2021-05-17 18:29:09] [INFO ] Flatten gal took : 51 ms
[2021-05-17 18:29:09] [INFO ] Input system was already deterministic with 591 transitions.
[2021-05-17 18:29:09] [INFO ] Flatten gal took : 51 ms
[2021-05-17 18:29:09] [INFO ] Flatten gal took : 39 ms
[2021-05-17 18:29:09] [INFO ] Time to serialize gal into /tmp/CTLFireability3839721296846010553.gal : 6 ms
[2021-05-17 18:29:09] [INFO ] Time to serialize properties into /tmp/CTLFireability3623385771840921253.ctl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability3839721296846010553.gal, -t, CGAL, -ctl, /tmp/CTLFireability3623385771840921253.ctl, --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.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability3839721296846010553.gal -t CGAL -ctl /tmp/CTLFireability3623385771840921253.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.39838e+53,0.457325,13108,2,1479,5,33370,6,0,2051,36653,0
Converting to forward existential form...Done !
original formula: (AF(AG((EG((((((((p1463==1)||(p1978==1))||(p1341==1))||(p26==1))||(((p1080==1)&&(p1134==1))&&(p1168==1)))||(p1953==1))&&((p585==1)||(p1551==1)))) * EF(((((((p1867==1)||(p1965==1))||(p484==1))||(p1962==1))||(p932==1))||(p995==1)))))) + EG(AF((((((((((p1039==1)||(p1999==1))||(p467==1))||(p435==1))||(p1253==1))||(p253==1))||((p1683==1)&&(p1702==1)))||(p381==1))||(p695==1)))))
=> equivalent forward existential formula: [FwdG((Init * !(EG(!(EG(!((((((((((p1039==1)||(p1999==1))||(p467==1))||(p435==1))||(p1253==1))||(p253==1))||((p1683==1)&&(p1702==1)))||(p381==1))||(p695==1)))))))),!(!(E(TRUE U !((EG((((((((p1463==1)||(p1978==1))||(p1341==1))||(p26==1))||(((p1080==1)&&(p1134==1))&&(p1168==1)))||(p1953==1))&&((p585==1)||(p1551==1)))) * E(TRUE U ((((((p1867==1)||(p1965==1))||(p484==1))||(p1962==1))||(p932==1))||(p995==1)))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t9, t14, t18, t19, t21, t24, t34, t37, t39, t40, t43, t45, t47, t48, t52, t54, t55, t57, t58, t60, t62, t64, t66, t68, t71, t74, t76, t78, t80, t84, t86, t88, t90, t92, t94, t96, t98, t100, t102, t104, t106, t108, t110, t112, t113, t116, t118, t120, t121, t126, t133, t138, t140, t144, t148, t154, t158, t162, t166, t170, t174, t178, t182, t186, t190, t192, t196, t202, t210, t214, t218, t222, t230, t234, t238, t242, t246, t250, t254, t257, t262, t264, t270, t274, t278, t282, t286, t290, t294, t298, t302, t306, t309, t313, t318, t322, t326, t328, t332, t338, t342, t346, t350, t354, t362, t366, t370, t374, t378, t382, t386, t390, t394, t398, t402, t406, t410, t412, t414, t420, t426, t430, t434, t438, t441, t445, t450, t454, t458, t462, t466, t470, t474, t475, t476, t477, t478, t482, t486, t490, t494, t498, t499, t500, t501, t502, t506, t509, t514, t516, t522, t526, t530, t534, t537, t541, t546, t550, t554, t558, t562, t566, t574, t578, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/425/166/591
Detected timeout of ITS tools.
[2021-05-17 18:29:39] [INFO ] Flatten gal took : 62 ms
[2021-05-17 18:29:39] [INFO ] Applying decomposition
[2021-05-17 18:29:39] [INFO ] Flatten gal took : 51 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph11395202081199904324.txt, -o, /tmp/graph11395202081199904324.bin, -w, /tmp/graph11395202081199904324.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph11395202081199904324.bin, -l, -1, -v, -w, /tmp/graph11395202081199904324.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 18:29:39] [INFO ] Decomposing Gal with order
[2021-05-17 18:29:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 18:29:40] [INFO ] Removed a total of 1052 redundant transitions.
[2021-05-17 18:29:40] [INFO ] Flatten gal took : 77 ms
[2021-05-17 18:29:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 430 labels/synchronizations in 33 ms.
[2021-05-17 18:29:40] [INFO ] Time to serialize gal into /tmp/CTLFireability9954054718951049804.gal : 20 ms
[2021-05-17 18:29:40] [INFO ] Time to serialize properties into /tmp/CTLFireability8847262423023887561.ctl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability9954054718951049804.gal, -t, CGAL, -ctl, /tmp/CTLFireability8847262423023887561.ctl], workingDir=/home/mcc/execution]
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability9954054718951049804.gal -t CGAL -ctl /tmp/CTLFireability8847262423023887561.ctl
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.39838e+53,0.598996,24284,456,32,43281,210,633,82359,69,563,0
Converting to forward existential form...Done !
original formula: (AF(AG((EG((((((((i9.u122.p1463==1)||(i13.u164.p1978==1))||(i8.u110.p1341==1))||(i4.u0.p26==1))||(((i7.u89.p1080==1)&&(i7.u93.p1134==1))&&(i7.u96.p1168==1)))||(i12.u160.p1953==1))&&((i3.u47.p585==1)||(i10.u130.p1551==1)))) * EF(((((((i12.u155.p1867==1)||(i13.u163.p1965==1))||(i3.u1.p484==1))||(i13.u162.p1962==1))||(i6.u77.p932==1))||(i6.u82.p995==1)))))) + EG(AF((((((((((i6.u86.p1039==1)||(i13.u166.p1999==1))||(i2.u37.p467==1))||(i2.u38.p435==1))||(i7.u103.p1253==1))||(i1.u20.p253==1))||((i11.u140.p1683==1)&&(i11.u142.p1702==1)))||(i2.u31.p381==1))||(i4.u57.p695==1)))))
=> equivalent forward existential formula: [FwdG((Init * !(EG(!(EG(!((((((((((i6.u86.p1039==1)||(i13.u166.p1999==1))||(i2.u37.p467==1))||(i2.u38.p435==1))||(i7.u103.p1253==1))||(i1.u20.p253==1))||((i11.u140.p1683==1)&&(i11.u142.p1702==1)))||(i2.u31.p381==1))||(i4.u57.p695==1)))))))),!(!(E(TRUE U !((EG((((((((i9.u122.p1463==1)||(i13.u164.p1978==1))||(i8.u110.p1341==1))||(i4.u0.p26==1))||(((i7.u89.p1080==1)&&(i7.u93.p1134==1))&&(i7.u96.p1168==1)))||(i12.u160.p1953==1))&&((i3.u47.p585==1)||(i10.u130.p1551==1)))) * E(TRUE U ((((((i12.u155.p1867==1)||(i13.u163.p1965==1))||(i3.u1.p484==1))||(i13.u162.p1962==1))||(i6.u77.p932==1))||(i6.u82.p995==1)))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t34, t177, t184, t209, t237, t264, t271, t302, t310, t335, t344, t371, t380, t429, t446, t453, t479, t487, t516, t526, t554, t560, i0.t159, i0.t154, i0.i0.t142, i0.i0.t148, i0.i0.i0.t137, i0.i0.i0.t134, i0.i0.i0.t36, i0.i0.i1.t144, i0.i0.i1.t38, i0.i1.t166, i0.i1.t171, i0.i1.i0.t156, i0.i1.i0.t41, i0.i1.i1.t168, i0.i1.i1.t42, i1.t199, i1.t197, i1.t193, i1.t188, i1.t181, i1.t46, i1.t44, i2.t229, i2.t221, i2.t217, i2.t214, i2.t55, i2.t51, i2.t49, i2.u31.t19, i2.u37.t21, i2.u38.t54, i3.t259, i3.t255, i3.t251, i3.t247, i3.t243, i3.t240, i3.t231, i3.t64, i3.t62, i3.t59, i3.t58, i3.t56, i4.t296, i4.t291, i4.t287, i4.t285, i4.t281, i4.t276, i4.t267, i4.t70, i4.t68, i4.t66, i5.t331, i5.t327, i5.t325, i5.t321, i5.t318, i5.t312, i5.t303, i5.t78, i5.t75, i5.t74, i6.t368, i6.t363, i6.t361, i6.t352, i6.t349, i6.t340, i6.t83, i6.t79, i6.u77.t14, i6.u82.t24, i7.t422, i7.t415, i7.t407, i7.t405, i7.t401, i7.t395, i7.t391, i7.t387, i7.t386, i7.t376, i7.t91, i7.t89, i7.t87, i7.t85, i7.u103.t412, i8.t441, i8.t437, i8.t433, i8.t424, i8.t96, i8.t94, i9.t478, i9.t474, i9.t470, i9.t464, i9.t460, i9.t458, i9.t448, i9.t102, i9.t100, i9.t98, i9.t9, i10.t512, i10.t507, i10.t506, i10.t500, i10.t496, i10.t493, i10.t484, i10.t109, i10.t108, i10.t105, i10.u130.t104, i11.t547, i11.t544, i11.t540, i11.t536, i11.t531, i11.t527, i11.t519, i11.t116, i11.t114, i11.t111, i12.t577, i12.t573, i12.t566, i12.t556, i12.t117, i12.t5, i12.u155.t120, i12.u157.t121, i13.t18, i13.u163.t126, i13.u164.t1, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/55/160/215
Detected timeout of ITS tools.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 484 transitions
Trivial Post-agglo rules discarded 484 transitions
Performed 484 trivial Post agglomeration. Transition count delta: 484
Iterating post reduction 0 with 484 rules applied. Total rules applied 484 place count 1775 transition count 1291
Reduce places removed 484 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 486 rules applied. Total rules applied 970 place count 1291 transition count 1289
Reduce places removed 1 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 2 with 7 rules applied. Total rules applied 977 place count 1290 transition count 1283
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 983 place count 1284 transition count 1283
Performed 214 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 214 Pre rules applied. Total rules applied 983 place count 1284 transition count 1069
Deduced a syphon composed of 214 places in 2 ms
Reduce places removed 214 places and 0 transitions.
Iterating global reduction 4 with 428 rules applied. Total rules applied 1411 place count 1070 transition count 1069
Discarding 151 places :
Symmetric choice reduction at 4 with 151 rule applications. Total rules 1562 place count 919 transition count 918
Iterating global reduction 4 with 151 rules applied. Total rules applied 1713 place count 919 transition count 918
Performed 103 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 103 Pre rules applied. Total rules applied 1713 place count 919 transition count 815
Deduced a syphon composed of 103 places in 2 ms
Reduce places removed 103 places and 0 transitions.
Iterating global reduction 4 with 206 rules applied. Total rules applied 1919 place count 816 transition count 815
Performed 341 Post agglomeration using F-continuation condition.Transition count delta: 341
Deduced a syphon composed of 341 places in 0 ms
Reduce places removed 341 places and 0 transitions.
Iterating global reduction 4 with 682 rules applied. Total rules applied 2601 place count 475 transition count 474
Renaming transitions due to excessive name length > 1024 char.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -95
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 2803 place count 374 transition count 569
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 2831 place count 360 transition count 582
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 2833 place count 360 transition count 582
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 2834 place count 359 transition count 581
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2835 place count 358 transition count 581
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 2836 place count 357 transition count 580
Applied a total of 2836 rules in 508 ms. Remains 357 /1776 variables (removed 1419) and now considering 580/1776 (removed 1196) transitions.
[2021-05-17 18:30:10] [INFO ] Flatten gal took : 40 ms
[2021-05-17 18:30:10] [INFO ] Flatten gal took : 42 ms
[2021-05-17 18:30:11] [INFO ] Input system was already deterministic with 580 transitions.
[2021-05-17 18:30:11] [INFO ] Flatten gal took : 43 ms
[2021-05-17 18:30:11] [INFO ] Flatten gal took : 43 ms
[2021-05-17 18:30:11] [INFO ] Time to serialize gal into /tmp/CTLFireability11519770005176202017.gal : 9 ms
[2021-05-17 18:30:11] [INFO ] Time to serialize properties into /tmp/CTLFireability7986735750235467152.ctl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability11519770005176202017.gal, -t, CGAL, -ctl, /tmp/CTLFireability7986735750235467152.ctl, --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.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability11519770005176202017.gal -t CGAL -ctl /tmp/CTLFireability7986735750235467152.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.74967e+52,0.474077,12792,2,1240,5,32219,6,0,2005,38346,0
Converting to forward existential form...Done !
original formula: !(A((EF(!(AG((((p1220==1)||(p1552==1))||(((p688==1)&&(p742==1))&&(p776==1)))))) + ((((((((p1382==0)&&(p1643==0))&&(p620==0))&&(p1645==0))&&(p1285==0))&&(p1142==0))&&(p1373==0))&&(((((p990==1)||(p1333==1))||(p1768==1))||(p794==1))||(p1607==1)))) U (((((p406==1)||(p148==1))||(p284==1))||(p1273==1))||(((p1766==1)&&(p1820==1))&&(p1854==1)))))
=> equivalent forward existential formula: ([(((FwdU(Init,!((((((p406==1)||(p148==1))||(p284==1))||(p1273==1))||(((p1766==1)&&(p1820==1))&&(p1854==1))))) * !((((((p406==1)||(p148==1))||(p284==1))||(p1273==1))||(((p1766==1)&&(p1820==1))&&(p1854==1))))) * !(((((((((p1382==0)&&(p1643==0))&&(p620==0))&&(p1645==0))&&(p1285==0))&&(p1142==0))&&(p1373==0))&&(((((p990==1)||(p1333==1))||(p1768==1))||(p794==1))||(p1607==1))))) * !(E(TRUE U !(!(E(TRUE U !((((p1220==1)||(p1552==1))||(((p688==1)&&(p742==1))&&(p776==1))))))))))] != FALSE + [FwdG(Init,!((((((p406==1)||(p148==1))||(p284==1))||(p1273==1))||(((p1766==1)&&(p1820==1))&&(p1854==1)))))] != FALSE)
Reverse transition relation is NOT exact ! Due to transitions t8, t9, t10, t13, t19, t22, t23, t25, t34, t36, t38, t40, t42, t44, t46, t48, t50, t52, t54, t56, t58, t60, t62, t64, t65, t66, t69, t71, t72, t74, t76, t78, t80, t82, t85, t88, t89, t121, t124, t128, t133, t137, t141, t143, t147, t153, t157, t164, t173, t177, t181, t185, t187, t190, t196, t201, t205, t209, t213, t217, t221, t225, t229, t233, t236, t241, t243, t249, t253, t257, t261, t262, t263, t264, t265, t269, t273, t277, t281, t283, t287, t293, t297, t301, t305, t308, t313, t315, t321, t325, t329, t333, t337, t341, t345, t349, t353, t355, t359, t365, t369, t372, t376, t381, t385, t389, t393, t397, t414, t415, t480, t481, t578, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/467/113/580
Hit Full ! (commute/partial/dont) 551/116/29
(forward)formula 0,1,4.09201,95092,1,0,996,682184,1192,304,17345,339357,1184
FORMULA ShieldRVt-PT-040B-CTLFireability-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
[2021-05-17 18:30:15] [INFO ] Flatten gal took : 67 ms
[2021-05-17 18:30:15] [INFO ] Flatten gal took : 77 ms
[2021-05-17 18:30:15] [INFO ] Applying decomposition
[2021-05-17 18:30:15] [INFO ] Flatten gal took : 62 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph12917513020317667197.txt, -o, /tmp/graph12917513020317667197.bin, -w, /tmp/graph12917513020317667197.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph12917513020317667197.bin, -l, -1, -v, -w, /tmp/graph12917513020317667197.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 18:30:15] [INFO ] Decomposing Gal with order
[2021-05-17 18:30:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 18:30:16] [INFO ] Removed a total of 252 redundant transitions.
[2021-05-17 18:30:16] [INFO ] Flatten gal took : 157 ms
[2021-05-17 18:30:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 6 ms.
[2021-05-17 18:30:16] [INFO ] Time to serialize gal into /tmp/CTLFireability2734180557117115391.gal : 29 ms
[2021-05-17 18:30:16] [INFO ] Time to serialize properties into /tmp/CTLFireability4302275262056428283.ctl : 7 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability2734180557117115391.gal, -t, CGAL, -ctl, /tmp/CTLFireability4302275262056428283.ctl], workingDir=/home/mcc/execution]
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability2734180557117115391.gal -t CGAL -ctl /tmp/CTLFireability4302275262056428283.ctl
No direction supplied, using forward translation only.
Parsed 15 CTL formulae.
Detected timeout of ITS tools.
[2021-05-17 18:52:05] [INFO ] Applying decomposition
[2021-05-17 18:52:05] [INFO ] Flatten gal took : 48 ms
[2021-05-17 18:52:05] [INFO ] Decomposing Gal with order
[2021-05-17 18:52:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 18:52:05] [INFO ] Removed a total of 55 redundant transitions.
[2021-05-17 18:52:05] [INFO ] Flatten gal took : 98 ms
[2021-05-17 18:52:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2021-05-17 18:52:06] [INFO ] Time to serialize gal into /tmp/CTLFireability15974027055786614737.gal : 25 ms
[2021-05-17 18:52:06] [INFO ] Time to serialize properties into /tmp/CTLFireability18021984921971711956.ctl : 23 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability15974027055786614737.gal, -t, CGAL, -ctl, /tmp/CTLFireability18021984921971711956.ctl], workingDir=/home/mcc/execution]
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability15974027055786614737.gal -t CGAL -ctl /tmp/CTLFireability18021984921971711956.ctl
No direction supplied, using forward translation only.
Parsed 15 CTL formulae.
Detected timeout of ITS tools.
[2021-05-17 19:13:55] [INFO ] Flatten gal took : 83 ms
[2021-05-17 19:13:55] [INFO ] Input system was already deterministic with 1776 transitions.
[2021-05-17 19:13:55] [INFO ] Transformed 1776 places.
[2021-05-17 19:13:55] [INFO ] Transformed 1776 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//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/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2021-05-17 19:13:56] [INFO ] Time to serialize gal into /tmp/CTLFireability9270754678756889333.gal : 12 ms
[2021-05-17 19:13:56] [INFO ] Time to serialize properties into /tmp/CTLFireability5377118893059148921.ctl : 4 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability9270754678756889333.gal, -t, CGAL, -ctl, /tmp/CTLFireability5377118893059148921.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.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability9270754678756889333.gal -t CGAL -ctl /tmp/CTLFireability5377118893059148921.ctl --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 15 CTL formulae.
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination CTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m
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="ShieldRVt-PT-040B"
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"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is ShieldRVt-PT-040B, 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 r235-smll-162106564800314"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVt-PT-040B.tgz
mv ShieldRVt-PT-040B 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 ;