Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.1M
-rw-r--r-- 1 mcc users 3.2K Apr 27 14:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 27 14:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 27 14:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 27 14:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 27 14:36 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Apr 27 14:36 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Apr 27 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 27 14:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Apr 27 14:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 27 14:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Apr 27 14:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 27 14:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 27 14:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 27 14:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Apr 27 14:36 equiv_col
-rw-r--r-- 1 mcc users 4 Apr 27 14:36 instance
-rw-r--r-- 1 mcc users 6 Apr 27 14:36 iscolored
-rw-r--r-- 1 mcc users 5.9M Apr 27 14:36 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 Dekker-PT-100-CTLCardinality-00
FORMULA_NAME Dekker-PT-100-CTLCardinality-01
FORMULA_NAME Dekker-PT-100-CTLCardinality-02
FORMULA_NAME Dekker-PT-100-CTLCardinality-03
FORMULA_NAME Dekker-PT-100-CTLCardinality-04
FORMULA_NAME Dekker-PT-100-CTLCardinality-05
FORMULA_NAME Dekker-PT-100-CTLCardinality-06
FORMULA_NAME Dekker-PT-100-CTLCardinality-07
FORMULA_NAME Dekker-PT-100-CTLCardinality-08
FORMULA_NAME Dekker-PT-100-CTLCardinality-09
FORMULA_NAME Dekker-PT-100-CTLCardinality-10
FORMULA_NAME Dekker-PT-100-CTLCardinality-11
FORMULA_NAME Dekker-PT-100-CTLCardinality-12
FORMULA_NAME Dekker-PT-100-CTLCardinality-13
FORMULA_NAME Dekker-PT-100-CTLCardinality-14
FORMULA_NAME Dekker-PT-100-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1590111260544

[2020-05-22 01:34:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-22 01:34:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-22 01:34:23] [INFO ] Load time of PNML (sax parser for PT used): 395 ms
[2020-05-22 01:34:23] [INFO ] Transformed 500 places.
[2020-05-22 01:34:23] [INFO ] Transformed 10200 transitions.
[2020-05-22 01:34:23] [INFO ] Found NUPN structural information;
[2020-05-22 01:34:23] [INFO ] Parsed PT model containing 500 places and 10200 transitions in 506 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 57 ms.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 1975 ms. (steps per millisecond=50 ) properties seen :[1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1]
[2020-05-22 01:34:25] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 500 cols
[2020-05-22 01:34:25] [INFO ] Computed 300 place invariants in 24 ms
[2020-05-22 01:34:25] [INFO ] [Real]Absence check using 200 positive place invariants in 111 ms returned sat
[2020-05-22 01:34:25] [INFO ] [Real]Absence check using 200 positive and 100 generalized place invariants in 57 ms returned sat
[2020-05-22 01:34:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 01:34:26] [INFO ] [Real]Absence check using state equation in 640 ms returned sat
[2020-05-22 01:34:26] [INFO ] State equation strengthened by 100 read => feed constraints.
[2020-05-22 01:34:26] [INFO ] [Real]Added 100 Read/Feed constraints in 69 ms returned sat
[2020-05-22 01:34:26] [INFO ] Deduced a trap composed of 4 places in 179 ms
[2020-05-22 01:34:27] [INFO ] Deduced a trap composed of 4 places in 161 ms
[2020-05-22 01:34:27] [INFO ] Deduced a trap composed of 4 places in 124 ms
[2020-05-22 01:34:27] [INFO ] Deduced a trap composed of 6 places in 118 ms
[2020-05-22 01:34:27] [INFO ] Deduced a trap composed of 6 places in 115 ms
[2020-05-22 01:34:27] [INFO ] Deduced a trap composed of 4 places in 102 ms
[2020-05-22 01:34:27] [INFO ] Deduced a trap composed of 4 places in 90 ms
[2020-05-22 01:34:27] [INFO ] Deduced a trap composed of 6 places in 84 ms
[2020-05-22 01:34:27] [INFO ] Deduced a trap composed of 4 places in 67 ms
[2020-05-22 01:34:28] [INFO ] Deduced a trap composed of 4 places in 73 ms
[2020-05-22 01:34:28] [INFO ] Deduced a trap composed of 4 places in 52 ms
[2020-05-22 01:34:28] [INFO ] Deduced a trap composed of 4 places in 46 ms
[2020-05-22 01:34:28] [INFO ] Deduced a trap composed of 4 places in 55 ms
[2020-05-22 01:34:28] [INFO ] Deduced a trap composed of 4 places in 50 ms
[2020-05-22 01:34:28] [INFO ] Deduced a trap composed of 4 places in 52 ms
[2020-05-22 01:34:28] [INFO ] Deduced a trap composed of 5 places in 55 ms
[2020-05-22 01:34:28] [INFO ] Deduced a trap composed of 4 places in 51 ms
[2020-05-22 01:34:28] [INFO ] Deduced a trap composed of 4 places in 28 ms
[2020-05-22 01:34:28] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 1983 ms
[2020-05-22 01:34:28] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 01:34:28] [INFO ] [Nat]Absence check using 200 positive place invariants in 90 ms returned sat
[2020-05-22 01:34:28] [INFO ] [Nat]Absence check using 200 positive and 100 generalized place invariants in 47 ms returned sat
[2020-05-22 01:34:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 01:34:29] [INFO ] [Nat]Absence check using state equation in 538 ms returned sat
[2020-05-22 01:34:29] [INFO ] [Nat]Added 100 Read/Feed constraints in 36 ms returned sat
[2020-05-22 01:34:29] [INFO ] Deduced a trap composed of 4 places in 143 ms
[2020-05-22 01:34:29] [INFO ] Deduced a trap composed of 6 places in 135 ms
[2020-05-22 01:34:29] [INFO ] Deduced a trap composed of 4 places in 108 ms
[2020-05-22 01:34:30] [INFO ] Deduced a trap composed of 4 places in 104 ms
[2020-05-22 01:34:30] [INFO ] Deduced a trap composed of 4 places in 117 ms
[2020-05-22 01:34:30] [INFO ] Deduced a trap composed of 4 places in 127 ms
[2020-05-22 01:34:30] [INFO ] Deduced a trap composed of 5 places in 164 ms
[2020-05-22 01:34:30] [INFO ] Deduced a trap composed of 6 places in 133 ms
[2020-05-22 01:34:30] [INFO ] Deduced a trap composed of 6 places in 93 ms
[2020-05-22 01:34:30] [INFO ] Deduced a trap composed of 6 places in 124 ms
[2020-05-22 01:34:31] [INFO ] Deduced a trap composed of 4 places in 100 ms
[2020-05-22 01:34:31] [INFO ] Deduced a trap composed of 6 places in 73 ms
[2020-05-22 01:34:31] [INFO ] Deduced a trap composed of 4 places in 82 ms
[2020-05-22 01:34:31] [INFO ] Deduced a trap composed of 6 places in 77 ms
[2020-05-22 01:34:31] [INFO ] Deduced a trap composed of 4 places in 76 ms
[2020-05-22 01:34:31] [INFO ] Deduced a trap composed of 4 places in 80 ms
[2020-05-22 01:34:31] [INFO ] Deduced a trap composed of 6 places in 70 ms
[2020-05-22 01:34:31] [INFO ] Deduced a trap composed of 5 places in 62 ms
[2020-05-22 01:34:31] [INFO ] Deduced a trap composed of 6 places in 115 ms
[2020-05-22 01:34:31] [INFO ] Deduced a trap composed of 4 places in 61 ms
[2020-05-22 01:34:32] [INFO ] Deduced a trap composed of 6 places in 80 ms
[2020-05-22 01:34:32] [INFO ] Deduced a trap composed of 5 places in 68 ms
[2020-05-22 01:34:32] [INFO ] Deduced a trap composed of 5 places in 48 ms
[2020-05-22 01:34:32] [INFO ] Deduced a trap composed of 4 places in 38 ms
[2020-05-22 01:34:32] [INFO ] Deduced a trap composed of 4 places in 90 ms
[2020-05-22 01:34:32] [INFO ] Deduced a trap composed of 6 places in 64 ms
[2020-05-22 01:34:32] [INFO ] Deduced a trap composed of 6 places in 61 ms
[2020-05-22 01:34:32] [INFO ] Deduced a trap composed of 4 places in 55 ms
[2020-05-22 01:34:32] [INFO ] Deduced a trap composed of 6 places in 64 ms
[2020-05-22 01:34:32] [INFO ] Deduced a trap composed of 4 places in 93 ms
[2020-05-22 01:34:32] [INFO ] Deduced a trap composed of 6 places in 74 ms
[2020-05-22 01:34:33] [INFO ] Deduced a trap composed of 5 places in 58 ms
[2020-05-22 01:34:33] [INFO ] Deduced a trap composed of 6 places in 57 ms
[2020-05-22 01:34:33] [INFO ] Deduced a trap composed of 5 places in 55 ms
[2020-05-22 01:34:33] [INFO ] Deduced a trap composed of 5 places in 51 ms
[2020-05-22 01:34:33] [INFO ] Deduced a trap composed of 4 places in 57 ms
[2020-05-22 01:34:33] [INFO ] Deduced a trap composed of 6 places in 71 ms
[2020-05-22 01:34:33] [INFO ] Deduced a trap composed of 5 places in 64 ms
[2020-05-22 01:34:33] [INFO ] Deduced a trap composed of 5 places in 69 ms
[2020-05-22 01:34:33] [INFO ] Deduced a trap composed of 4 places in 55 ms
[2020-05-22 01:34:33] [INFO ] Deduced a trap composed of 4 places in 75 ms
[2020-05-22 01:34:33] [INFO ] Deduced a trap composed of 4 places in 76 ms
[2020-05-22 01:34:33] [INFO ] Trap strengthening (SAT) tested/added 43/42 trap constraints in 4512 ms
[2020-05-22 01:34:34] [INFO ] Computed and/alt/rep : 10100/30000/300 causal constraints in 271 ms.
[2020-05-22 01:34:36] [INFO ] Added : 101 causal constraints over 21 iterations in 2780 ms. Result :sat
[2020-05-22 01:34:37] [INFO ] [Real]Absence check using 200 positive place invariants in 97 ms returned sat
[2020-05-22 01:34:37] [INFO ] [Real]Absence check using 200 positive and 100 generalized place invariants in 54 ms returned sat
[2020-05-22 01:34:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 01:34:37] [INFO ] [Real]Absence check using state equation in 731 ms returned sat
[2020-05-22 01:34:37] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 01:34:38] [INFO ] [Nat]Absence check using 200 positive place invariants in 91 ms returned sat
[2020-05-22 01:34:38] [INFO ] [Nat]Absence check using 200 positive and 100 generalized place invariants in 51 ms returned sat
[2020-05-22 01:34:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 01:34:38] [INFO ] [Nat]Absence check using state equation in 669 ms returned sat
[2020-05-22 01:34:38] [INFO ] [Nat]Added 100 Read/Feed constraints in 30 ms returned sat
[2020-05-22 01:34:38] [INFO ] Deduced a trap composed of 4 places in 107 ms
[2020-05-22 01:34:39] [INFO ] Deduced a trap composed of 5 places in 110 ms
[2020-05-22 01:34:39] [INFO ] Deduced a trap composed of 4 places in 106 ms
[2020-05-22 01:34:39] [INFO ] Deduced a trap composed of 4 places in 106 ms
[2020-05-22 01:34:39] [INFO ] Deduced a trap composed of 5 places in 114 ms
[2020-05-22 01:34:39] [INFO ] Deduced a trap composed of 4 places in 88 ms
[2020-05-22 01:34:39] [INFO ] Deduced a trap composed of 6 places in 108 ms
[2020-05-22 01:34:39] [INFO ] Deduced a trap composed of 4 places in 92 ms
[2020-05-22 01:34:39] [INFO ] Deduced a trap composed of 4 places in 71 ms
[2020-05-22 01:34:40] [INFO ] Deduced a trap composed of 4 places in 63 ms
[2020-05-22 01:34:40] [INFO ] Deduced a trap composed of 4 places in 84 ms
[2020-05-22 01:34:40] [INFO ] Deduced a trap composed of 5 places in 76 ms
[2020-05-22 01:34:40] [INFO ] Deduced a trap composed of 4 places in 58 ms
[2020-05-22 01:34:40] [INFO ] Deduced a trap composed of 4 places in 61 ms
[2020-05-22 01:34:40] [INFO ] Deduced a trap composed of 4 places in 75 ms
[2020-05-22 01:34:40] [INFO ] Deduced a trap composed of 5 places in 66 ms
[2020-05-22 01:34:40] [INFO ] Deduced a trap composed of 4 places in 58 ms
[2020-05-22 01:34:40] [INFO ] Deduced a trap composed of 4 places in 78 ms
[2020-05-22 01:34:40] [INFO ] Deduced a trap composed of 4 places in 63 ms
[2020-05-22 01:34:41] [INFO ] Deduced a trap composed of 5 places in 62 ms
[2020-05-22 01:34:41] [INFO ] Deduced a trap composed of 4 places in 55 ms
[2020-05-22 01:34:41] [INFO ] Deduced a trap composed of 4 places in 67 ms
[2020-05-22 01:34:41] [INFO ] Deduced a trap composed of 5 places in 60 ms
[2020-05-22 01:34:41] [INFO ] Deduced a trap composed of 4 places in 55 ms
[2020-05-22 01:34:41] [INFO ] Deduced a trap composed of 5 places in 82 ms
[2020-05-22 01:34:41] [INFO ] Deduced a trap composed of 4 places in 48 ms
[2020-05-22 01:34:41] [INFO ] Deduced a trap composed of 4 places in 53 ms
[2020-05-22 01:34:41] [INFO ] Deduced a trap composed of 4 places in 43 ms
[2020-05-22 01:34:41] [INFO ] Trap strengthening (SAT) tested/added 29/28 trap constraints in 2896 ms
[2020-05-22 01:34:41] [INFO ] Computed and/alt/rep : 10100/30000/300 causal constraints in 181 ms.
[2020-05-22 01:34:44] [INFO ] Added : 101 causal constraints over 21 iterations in 2322 ms. Result :sat
[2020-05-22 01:34:44] [INFO ] [Real]Absence check using 200 positive place invariants in 120 ms returned sat
[2020-05-22 01:34:44] [INFO ] [Real]Absence check using 200 positive and 100 generalized place invariants in 54 ms returned sat
[2020-05-22 01:34:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 01:34:45] [INFO ] [Real]Absence check using state equation in 697 ms returned sat
[2020-05-22 01:34:45] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 01:34:45] [INFO ] [Nat]Absence check using 200 positive place invariants in 94 ms returned sat
[2020-05-22 01:34:45] [INFO ] [Nat]Absence check using 200 positive and 100 generalized place invariants in 81 ms returned sat
[2020-05-22 01:34:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 01:34:46] [INFO ] [Nat]Absence check using state equation in 677 ms returned sat
[2020-05-22 01:34:46] [INFO ] [Nat]Added 100 Read/Feed constraints in 36 ms returned sat
[2020-05-22 01:34:46] [INFO ] Deduced a trap composed of 4 places in 161 ms
[2020-05-22 01:34:46] [INFO ] Deduced a trap composed of 4 places in 174 ms
[2020-05-22 01:34:46] [INFO ] Deduced a trap composed of 4 places in 109 ms
[2020-05-22 01:34:46] [INFO ] Deduced a trap composed of 4 places in 104 ms
[2020-05-22 01:34:46] [INFO ] Deduced a trap composed of 4 places in 129 ms
[2020-05-22 01:34:46] [INFO ] Deduced a trap composed of 4 places in 115 ms
[2020-05-22 01:34:47] [INFO ] Deduced a trap composed of 5 places in 113 ms
[2020-05-22 01:34:47] [INFO ] Deduced a trap composed of 6 places in 92 ms
[2020-05-22 01:34:47] [INFO ] Deduced a trap composed of 4 places in 72 ms
[2020-05-22 01:34:47] [INFO ] Deduced a trap composed of 6 places in 80 ms
[2020-05-22 01:34:47] [INFO ] Deduced a trap composed of 4 places in 54 ms
[2020-05-22 01:34:47] [INFO ] Deduced a trap composed of 4 places in 49 ms
[2020-05-22 01:34:47] [INFO ] Deduced a trap composed of 4 places in 72 ms
[2020-05-22 01:34:47] [INFO ] Deduced a trap composed of 4 places in 72 ms
[2020-05-22 01:34:47] [INFO ] Deduced a trap composed of 4 places in 67 ms
[2020-05-22 01:34:47] [INFO ] Deduced a trap composed of 4 places in 66 ms
[2020-05-22 01:34:48] [INFO ] Deduced a trap composed of 4 places in 59 ms
[2020-05-22 01:34:48] [INFO ] Deduced a trap composed of 4 places in 59 ms
[2020-05-22 01:34:48] [INFO ] Deduced a trap composed of 4 places in 53 ms
[2020-05-22 01:34:48] [INFO ] Deduced a trap composed of 4 places in 88 ms
[2020-05-22 01:34:48] [INFO ] Deduced a trap composed of 4 places in 73 ms
[2020-05-22 01:34:48] [INFO ] Deduced a trap composed of 4 places in 54 ms
[2020-05-22 01:34:48] [INFO ] Deduced a trap composed of 4 places in 66 ms
[2020-05-22 01:34:48] [INFO ] Deduced a trap composed of 4 places in 69 ms
[2020-05-22 01:34:48] [INFO ] Deduced a trap composed of 4 places in 53 ms
[2020-05-22 01:34:48] [INFO ] Deduced a trap composed of 4 places in 57 ms
[2020-05-22 01:34:48] [INFO ] Deduced a trap composed of 4 places in 67 ms
[2020-05-22 01:34:49] [INFO ] Deduced a trap composed of 4 places in 59 ms
[2020-05-22 01:34:49] [INFO ] Deduced a trap composed of 4 places in 68 ms
[2020-05-22 01:34:49] [INFO ] Deduced a trap composed of 4 places in 55 ms
[2020-05-22 01:34:49] [INFO ] Deduced a trap composed of 4 places in 57 ms
[2020-05-22 01:34:49] [INFO ] Deduced a trap composed of 4 places in 64 ms
[2020-05-22 01:34:49] [INFO ] Deduced a trap composed of 4 places in 78 ms
[2020-05-22 01:34:49] [INFO ] Deduced a trap composed of 4 places in 66 ms
[2020-05-22 01:34:49] [INFO ] Deduced a trap composed of 4 places in 59 ms
[2020-05-22 01:34:49] [INFO ] Deduced a trap composed of 4 places in 47 ms
[2020-05-22 01:34:49] [INFO ] Trap strengthening (SAT) tested/added 37/36 trap constraints in 3754 ms
[2020-05-22 01:34:50] [INFO ] Computed and/alt/rep : 10100/30000/300 causal constraints in 189 ms.
[2020-05-22 01:34:52] [INFO ] Added : 101 causal constraints over 21 iterations in 2406 ms. Result :sat
[2020-05-22 01:34:52] [INFO ] [Real]Absence check using 200 positive place invariants in 103 ms returned sat
[2020-05-22 01:34:52] [INFO ] [Real]Absence check using 200 positive and 100 generalized place invariants in 53 ms returned sat
[2020-05-22 01:34:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 01:34:53] [INFO ] [Real]Absence check using state equation in 661 ms returned sat
[2020-05-22 01:34:53] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 01:34:53] [INFO ] [Nat]Absence check using 200 positive place invariants in 92 ms returned sat
[2020-05-22 01:34:53] [INFO ] [Nat]Absence check using 200 positive and 100 generalized place invariants in 50 ms returned sat
[2020-05-22 01:34:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 01:34:53] [INFO ] [Nat]Absence check using state equation in 515 ms returned sat
[2020-05-22 01:34:53] [INFO ] [Nat]Added 100 Read/Feed constraints in 32 ms returned sat
[2020-05-22 01:34:54] [INFO ] Deduced a trap composed of 4 places in 109 ms
[2020-05-22 01:34:54] [INFO ] Deduced a trap composed of 4 places in 97 ms
[2020-05-22 01:34:54] [INFO ] Deduced a trap composed of 4 places in 106 ms
[2020-05-22 01:34:54] [INFO ] Deduced a trap composed of 4 places in 119 ms
[2020-05-22 01:34:54] [INFO ] Deduced a trap composed of 4 places in 84 ms
[2020-05-22 01:34:54] [INFO ] Deduced a trap composed of 4 places in 82 ms
[2020-05-22 01:34:54] [INFO ] Deduced a trap composed of 4 places in 66 ms
[2020-05-22 01:34:54] [INFO ] Deduced a trap composed of 4 places in 87 ms
[2020-05-22 01:34:55] [INFO ] Deduced a trap composed of 5 places in 85 ms
[2020-05-22 01:34:55] [INFO ] Deduced a trap composed of 4 places in 79 ms
[2020-05-22 01:34:55] [INFO ] Deduced a trap composed of 5 places in 62 ms
[2020-05-22 01:34:55] [INFO ] Deduced a trap composed of 5 places in 64 ms
[2020-05-22 01:34:55] [INFO ] Deduced a trap composed of 4 places in 82 ms
[2020-05-22 01:34:55] [INFO ] Deduced a trap composed of 5 places in 75 ms
[2020-05-22 01:34:55] [INFO ] Deduced a trap composed of 5 places in 62 ms
[2020-05-22 01:34:55] [INFO ] Deduced a trap composed of 5 places in 67 ms
[2020-05-22 01:34:55] [INFO ] Deduced a trap composed of 4 places in 48 ms
[2020-05-22 01:34:55] [INFO ] Deduced a trap composed of 4 places in 42 ms
[2020-05-22 01:34:55] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 1878 ms
[2020-05-22 01:34:56] [INFO ] Computed and/alt/rep : 10100/30000/300 causal constraints in 194 ms.
[2020-05-22 01:34:58] [INFO ] Added : 101 causal constraints over 21 iterations in 2595 ms. Result :sat
[2020-05-22 01:34:58] [INFO ] [Real]Absence check using 200 positive place invariants in 95 ms returned sat
[2020-05-22 01:34:58] [INFO ] [Real]Absence check using 200 positive and 100 generalized place invariants in 52 ms returned sat
[2020-05-22 01:34:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 01:34:59] [INFO ] [Real]Absence check using state equation in 674 ms returned sat
[2020-05-22 01:34:59] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 01:34:59] [INFO ] [Nat]Absence check using 200 positive place invariants in 67 ms returned sat
[2020-05-22 01:34:59] [INFO ] [Nat]Absence check using 200 positive and 100 generalized place invariants in 38 ms returned sat
[2020-05-22 01:34:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 01:35:00] [INFO ] [Nat]Absence check using state equation in 529 ms returned sat
[2020-05-22 01:35:00] [INFO ] [Nat]Added 100 Read/Feed constraints in 30 ms returned sat
[2020-05-22 01:35:00] [INFO ] Deduced a trap composed of 4 places in 135 ms
[2020-05-22 01:35:00] [INFO ] Deduced a trap composed of 6 places in 124 ms
[2020-05-22 01:35:00] [INFO ] Deduced a trap composed of 4 places in 120 ms
[2020-05-22 01:35:00] [INFO ] Deduced a trap composed of 4 places in 93 ms
[2020-05-22 01:35:00] [INFO ] Deduced a trap composed of 4 places in 130 ms
[2020-05-22 01:35:01] [INFO ] Deduced a trap composed of 6 places in 97 ms
[2020-05-22 01:35:01] [INFO ] Deduced a trap composed of 4 places in 110 ms
[2020-05-22 01:35:01] [INFO ] Deduced a trap composed of 6 places in 108 ms
[2020-05-22 01:35:01] [INFO ] Deduced a trap composed of 6 places in 103 ms
[2020-05-22 01:35:01] [INFO ] Deduced a trap composed of 6 places in 94 ms
[2020-05-22 01:35:01] [INFO ] Deduced a trap composed of 6 places in 79 ms
[2020-05-22 01:35:01] [INFO ] Deduced a trap composed of 4 places in 76 ms
[2020-05-22 01:35:01] [INFO ] Deduced a trap composed of 6 places in 80 ms
[2020-05-22 01:35:01] [INFO ] Deduced a trap composed of 4 places in 65 ms
[2020-05-22 01:35:02] [INFO ] Deduced a trap composed of 4 places in 123 ms
[2020-05-22 01:35:02] [INFO ] Deduced a trap composed of 6 places in 134 ms
[2020-05-22 01:35:02] [INFO ] Deduced a trap composed of 4 places in 98 ms
[2020-05-22 01:35:02] [INFO ] Deduced a trap composed of 4 places in 95 ms
[2020-05-22 01:35:02] [INFO ] Deduced a trap composed of 6 places in 80 ms
[2020-05-22 01:35:02] [INFO ] Deduced a trap composed of 4 places in 79 ms
[2020-05-22 01:35:02] [INFO ] Deduced a trap composed of 6 places in 89 ms
[2020-05-22 01:35:02] [INFO ] Deduced a trap composed of 4 places in 81 ms
[2020-05-22 01:35:03] [INFO ] Deduced a trap composed of 4 places in 98 ms
[2020-05-22 01:35:03] [INFO ] Deduced a trap composed of 4 places in 112 ms
[2020-05-22 01:35:03] [INFO ] Deduced a trap composed of 6 places in 109 ms
[2020-05-22 01:35:03] [INFO ] Deduced a trap composed of 4 places in 83 ms
[2020-05-22 01:35:03] [INFO ] Deduced a trap composed of 6 places in 92 ms
[2020-05-22 01:35:03] [INFO ] Deduced a trap composed of 4 places in 82 ms
[2020-05-22 01:35:03] [INFO ] Deduced a trap composed of 4 places in 82 ms
[2020-05-22 01:35:03] [INFO ] Deduced a trap composed of 6 places in 73 ms
[2020-05-22 01:35:04] [INFO ] Deduced a trap composed of 4 places in 81 ms
[2020-05-22 01:35:04] [INFO ] Deduced a trap composed of 4 places in 74 ms
[2020-05-22 01:35:04] [INFO ] Deduced a trap composed of 4 places in 75 ms
[2020-05-22 01:35:04] [INFO ] Deduced a trap composed of 5 places in 75 ms
[2020-05-22 01:35:04] [INFO ] Deduced a trap composed of 4 places in 53 ms
[2020-05-22 01:35:04] [INFO ] Deduced a trap composed of 4 places in 60 ms
[2020-05-22 01:35:04] [INFO ] Deduced a trap composed of 4 places in 47 ms
[2020-05-22 01:35:04] [INFO ] Trap strengthening (SAT) tested/added 38/37 trap constraints in 4421 ms
[2020-05-22 01:35:04] [INFO ] Computed and/alt/rep : 10100/30000/300 causal constraints in 225 ms.
[2020-05-22 01:35:07] [INFO ] Added : 101 causal constraints over 21 iterations in 2493 ms. Result :sat
[2020-05-22 01:35:08] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2020-05-22 01:35:08] [INFO ] Flatten gal took : 758 ms
[2020-05-22 01:35:08] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2020-05-22 01:35:08] [INFO ] Flatten gal took : 445 ms
FORMULA Dekker-PT-100-CTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-100-CTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-100-CTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-100-CTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-100-CTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-100-CTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-22 01:35:09] [INFO ] Applying decomposition
[2020-05-22 01:35:09] [INFO ] Flatten gal took : 559 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/convert-linux64, -i, /tmp/graph5322922366994020665.txt, -o, /tmp/graph5322922366994020665.bin, -w, /tmp/graph5322922366994020665.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph5322922366994020665.bin, -l, -1, -v, -w, /tmp/graph5322922366994020665.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-22 01:35:10] [INFO ] Decomposing Gal with order
[2020-05-22 01:35:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-22 01:35:11] [INFO ] Removed a total of 33657 redundant transitions.
[2020-05-22 01:35:12] [INFO ] Flatten gal took : 998 ms
[2020-05-22 01:35:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 295 ms.
[2020-05-22 01:35:12] [INFO ] Time to serialize gal into /home/mcc/execution/CTLCardinality.pnml.gal : 90 ms
[2020-05-22 01:35:12] [INFO ] Time to serialize properties into /home/mcc/execution/CTLCardinality.ctl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/CTLCardinality.pnml.gal, -t, CGAL, -ctl, /home/mcc/execution/CTLCardinality.ctl], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/CTLCardinality.pnml.gal -t CGAL -ctl /home/mcc/execution/CTLCardinality.ctl
No direction supplied, using forward translation only.
Parsed 10 CTL formulae.
built 4951 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.46502e+31,3.60874,44200,219,15,3202,5186,10652,2554,40,7527,0


Converting to forward existential form...Done !
original formula: EG((i78.u109.p0_22==1))
=> equivalent forward existential formula: [FwdG(Init,(i78.u109.p0_22==1))] != FALSE
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found an SCC at level 33
Fast SCC detection found an SCC at level 34
Fast SCC detection found an SCC at level 35
Fast SCC detection found an SCC at level 36
Fast SCC detection found an SCC at level 37
Fast SCC detection found an SCC at level 38
Fast SCC detection found an SCC at level 39
Fast SCC detection found an SCC at level 40
Fast SCC detection found an SCC at level 41
Fast SCC detection found an SCC at level 42
Fast SCC detection found an SCC at level 43
Fast SCC detection found an SCC at level 44
Fast SCC detection found an SCC at level 45
Fast SCC detection found an SCC at level 46
Fast SCC detection found an SCC at level 47
Fast SCC detection found an SCC at level 48
Fast SCC detection found an SCC at level 49
Fast SCC detection found an SCC at level 50
Fast SCC detection found an SCC at level 51
Fast SCC detection found an SCC at level 52
Fast SCC detection found an SCC at level 53
Fast SCC detection found an SCC at level 54
Fast SCC detection found an SCC at level 55
Fast SCC detection found an SCC at level 56
Fast SCC detection found an SCC at level 57
Fast SCC detection found an SCC at level 58
Fast SCC detection found an SCC at level 59
Fast SCC detection found an SCC at level 60
Fast SCC detection found an SCC at level 61
Fast SCC detection found an SCC at level 62
Fast SCC detection found an SCC at level 63
Fast SCC detection found an SCC at level 64
Fast SCC detection found an SCC at level 65
Fast SCC detection found an SCC at level 66
Fast SCC detection found an SCC at level 67
Fast SCC detection found an SCC at level 68
Fast SCC detection found an SCC at level 69
Fast SCC detection found an SCC at level 70
Fast SCC detection found an SCC at level 71
Fast SCC detection found an SCC at level 72
Fast SCC detection found an SCC at level 73
Fast SCC detection found an SCC at level 74
Fast SCC detection found an SCC at level 75
Fast SCC detection found an SCC at level 76
Fast SCC detection found an SCC at level 77
Fast SCC detection found an SCC at level 78
Fast SCC detection found an SCC at level 79
Fast SCC detection found an SCC at level 80
Fast SCC detection found an SCC at level 81
Fast SCC detection found an SCC at level 82
Fast SCC detection found an SCC at level 83
Fast SCC detection found an SCC at level 84
Fast SCC detection found an SCC at level 85
Fast SCC detection found an SCC at level 86
Fast SCC detection found an SCC at level 87
Fast SCC detection found an SCC at level 88
Fast SCC detection found an SCC at level 89
Fast SCC detection found an SCC at level 90
Fast SCC detection found an SCC at level 91
Fast SCC detection found an SCC at level 92
Fast SCC detection found an SCC at level 93
Fast SCC detection found an SCC at level 94
Fast SCC detection found an SCC at level 95
Fast SCC detection found an SCC at level 96
Fast SCC detection found an SCC at level 97
Fast SCC detection found an SCC at level 98
Fast SCC detection found an SCC at level 99
(forward)formula 0,1,7.38573,85236,1,0,5744,5186,54837,5640,160,7527,22662
FORMULA Dekker-PT-100-CTLCardinality-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AG(((((u56.p0_57==0)||(u71.p3_73==1))||(u46.p3_47==0))||(i13.u22.flag_0_23==1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(((((u56.p0_57==0)||(u71.p3_73==1))||(u46.p3_47==0))||(i13.u22.flag_0_23==1))))] = FALSE
(forward)formula 1,0,7.40229,86556,1,0,5977,5186,54851,5880,163,7527,22867
FORMULA Dekker-PT-100-CTLCardinality-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EG(E(((u65.flag_1_67==0)||(u89.flag_0_92==1)) U ((i90.u62.flag_1_64==0)||(i78.u109.p1_22==1))))
=> equivalent forward existential formula: [FwdG(Init,E(((u65.flag_1_67==0)||(u89.flag_0_92==1)) U ((i90.u62.flag_1_64==0)||(i78.u109.p1_22==1))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions u2.exit_3, u9.exit_9, u12.exit_13, u14.exit_15, u15.exit_17, u19.exit_20, u23.exit_25, u24.exit_26, u27.exit_30, u30.exit_32, u33.exit_35, u38.exit_38, u39.exit_39, u40.exit_41, u41.exit_42, u46.exit_47, u50.exit_51, u51.exit_52, u52.exit_53, u53.exit_54, u54.exit_55, u56.exit_57, u58.exit_60, u59.exit_61, u61.exit_63, u64.exit_66, u65.exit_67, u66.exit_68, u67.exit_69, u68.exit_70, u69.exit_71, u70.exit_72, u71.exit_73, u72.exit_74, u75.exit_78, u77.exit_80, u81.exit_83, u83.exit_86, u85.exit_88, u89.exit_92, u91.exit_95, u93.exit_97, u97.exit_0, u102.exit_8, u103.exit_11, u104.exit_12, u106.exit_16, u111.exit_24, u114.exit_29, u115.exit_33, u116.exit_40, u118.exit_44, u121.exit_50, u124.exit_59, u129.exit_76, u134.exit_85, u139.exit_93, i1.exit_4, i2.exit_6, i3.exit_7, i5.exit_10, i7.exit_14, i10.exit_18, i11.exit_19, i13.exit_23, i16.exit_28, i18.exit_31, i20.exit_34, i22.exit_36, i23.exit_37, i28.exit_43, i29.exit_45, i30.exit_46, i32.exit_48, i38.exit_56, i52.exit_77, i54.exit_79, i56.exit_81, i58.exit_84, i61.exit_89, i62.exit_90, i63.exit_91, i66.exit_96, i68.exit_99, i70.exit_1, i71.exit_2, i72.exit_5, i77.exit_21, i78.exit_22, i80.exit_27, i85.exit_49, i87.exit_58, i89.exit_62, i90.exit_64, i91.exit_65, i92.exit_75, i94.exit_82, i96.exit_87, i98.exit_94, i99.exit_98, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/10100/100/10200
(forward)formula 2,1,17.3775,473844,1,0,1.34198e+06,5186,81950,726448,434,7527,1686678
FORMULA Dekker-PT-100-CTLCardinality-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: (AX(FALSE) + AF(AG(((i92.u128.p3_75==0)||(i22.u34.p1_36==1)))))
=> equivalent forward existential formula: [FwdG((Init * !(!(EX(!(FALSE))))),!(!(E(TRUE U !(((i92.u128.p3_75==0)||(i22.u34.p1_36==1)))))))] = FALSE
(forward)formula 3,0,18.9614,520572,1,0,1.34546e+06,5186,82572,731581,434,7527,1697422
FORMULA Dekker-PT-100-CTLCardinality-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AF(AX(FALSE))
=> equivalent forward existential formula: [FwdG(Init,!(!(EX(!(FALSE)))))] = FALSE
(forward)formula 4,0,18.9617,520572,1,0,1.34546e+06,5186,82572,731581,434,7527,1697422
FORMULA Dekker-PT-100-CTLCardinality-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AX((i38.u55.p1_56==1))
=> equivalent forward existential formula: [(EY(Init) * !((i38.u55.p1_56==1)))] = FALSE
(forward)formula 5,0,18.9634,520572,1,0,1.34562e+06,5186,82576,731867,435,7527,1697565
FORMULA Dekker-PT-100-CTLCardinality-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: (AF(((u121.p0_50!=0)&&(u97.p0_0!=1))) + A((u58.p0_60==1) U (i61.u86.p1_89==1)))
=> equivalent forward existential formula: [FwdG((Init * !(!((E(!((i61.u86.p1_89==1)) U (!((u58.p0_60==1)) * !((i61.u86.p1_89==1)))) + EG(!((i61.u86.p1_89==1))))))),!(((u121.p0_50!=0)&&(u97.p0_0!=1))))] = FALSE
(forward)formula 6,0,22.0445,546180,1,0,1.3491e+06,5186,83566,737488,438,7527,1706368
FORMULA Dekker-PT-100-CTLCardinality-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: (AX((((u89.p1_92!=1)&&(u83.p1_86!=0))&&(i87.u57.p1_58!=1))) + AG(EF((i18.u28.p1_31==1))))
=> equivalent forward existential formula: [(FwdU((Init * !(!(EX(!((((u89.p1_92!=1)&&(u83.p1_86!=0))&&(i87.u57.p1_58!=1))))))),TRUE) * !(E(TRUE U (i18.u28.p1_31==1))))] = FALSE
(forward)formula 7,1,22.0666,546444,1,0,1.3502e+06,5186,83567,738597,438,7527,1708851
FORMULA Dekker-PT-100-CTLCardinality-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EG(EX(((i18.u28.flag_0_31==0)||(u61.p3_63==1))))
=> equivalent forward existential formula: [FwdG(Init,EX(((i18.u28.flag_0_31==0)||(u61.p3_63==1))))] != FALSE
(forward)formula 8,1,22.0865,546444,1,0,1.35163e+06,5186,83572,740478,439,7527,1712611
FORMULA Dekker-PT-100-CTLCardinality-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EG((EX(((u66.p0_68==0)||(u52.p1_53==1))) + EG(((u61.p0_63==0)||(i30.u45.p1_46==1)))))
=> equivalent forward existential formula: [FwdG(Init,(EX(((u66.p0_68==0)||(u52.p1_53==1))) + EG(((u61.p0_63==0)||(i30.u45.p1_46==1)))))] != FALSE
(forward)formula 9,1,22.1663,548820,1,0,1.3541e+06,5186,83591,743364,440,7527,1718661
FORMULA Dekker-PT-100-CTLCardinality-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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


BK_STOP 1590111335348

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Dekker-PT-100"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is Dekker-PT-100, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r066-tajo-158922814200339"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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