fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r180-ebro-158987900000282
Last Updated
Jun 28, 2020

About the Execution of ITS-LoLa for DES-PT-30b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15744.090 3600000.00 3653485.00 2172.30 ?F?F?TFTFTFT??FF normal

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.r180-ebro-158987900000282.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 itslola
Input is DES-PT-30b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r180-ebro-158987900000282
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 280K
-rw-r--r-- 1 mcc users 3.3K Mar 30 01:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 30 01:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 28 16:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Apr 8 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 8 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.8K Mar 27 08:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 14K Mar 27 08:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 26 08:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 26 08:17 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 28 14:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Mar 28 14:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 103K Mar 24 05:37 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME DES-PT-30b-00
FORMULA_NAME DES-PT-30b-01
FORMULA_NAME DES-PT-30b-02
FORMULA_NAME DES-PT-30b-03
FORMULA_NAME DES-PT-30b-04
FORMULA_NAME DES-PT-30b-05
FORMULA_NAME DES-PT-30b-06
FORMULA_NAME DES-PT-30b-07
FORMULA_NAME DES-PT-30b-08
FORMULA_NAME DES-PT-30b-09
FORMULA_NAME DES-PT-30b-10
FORMULA_NAME DES-PT-30b-11
FORMULA_NAME DES-PT-30b-12
FORMULA_NAME DES-PT-30b-13
FORMULA_NAME DES-PT-30b-14
FORMULA_NAME DES-PT-30b-15

=== Now, execution of the tool begins

BK_START 1591188228294

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 12:43:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 12:43:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 12:43:51] [INFO ] Load time of PNML (sax parser for PT used): 164 ms
[2020-06-03 12:43:51] [INFO ] Transformed 399 places.
[2020-06-03 12:43:51] [INFO ] Transformed 350 transitions.
[2020-06-03 12:43:51] [INFO ] Found NUPN structural information;
[2020-06-03 12:43:51] [INFO ] Parsed PT model containing 399 places and 350 transitions in 252 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 59 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 865 resets, run finished after 594 ms. (steps per millisecond=168 ) properties seen :[1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 0, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 0]
// Phase 1: matrix 350 rows 399 cols
[2020-06-03 12:43:52] [INFO ] Computed 65 place invariants in 56 ms
[2020-06-03 12:43:52] [INFO ] [Real]Absence check using 39 positive place invariants in 101 ms returned sat
[2020-06-03 12:43:52] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 37 ms returned sat
[2020-06-03 12:43:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 12:43:53] [INFO ] [Real]Absence check using state equation in 869 ms returned sat
[2020-06-03 12:43:53] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 12:43:54] [INFO ] [Nat]Absence check using 39 positive place invariants in 76 ms returned sat
[2020-06-03 12:43:54] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 80 ms returned sat
[2020-06-03 12:43:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 12:43:55] [INFO ] [Nat]Absence check using state equation in 1185 ms returned sat
[2020-06-03 12:43:55] [INFO ] Deduced a trap composed of 20 places in 274 ms
[2020-06-03 12:43:56] [INFO ] Deduced a trap composed of 14 places in 203 ms
[2020-06-03 12:43:56] [INFO ] Deduced a trap composed of 31 places in 187 ms
[2020-06-03 12:43:56] [INFO ] Deduced a trap composed of 8 places in 113 ms
[2020-06-03 12:43:56] [INFO ] Deduced a trap composed of 32 places in 175 ms
[2020-06-03 12:43:56] [INFO ] Deduced a trap composed of 21 places in 149 ms
[2020-06-03 12:43:57] [INFO ] Deduced a trap composed of 23 places in 136 ms
[2020-06-03 12:43:57] [INFO ] Deduced a trap composed of 42 places in 136 ms
[2020-06-03 12:43:57] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1880 ms
[2020-06-03 12:43:57] [INFO ] Computed and/alt/rep : 349/847/349 causal constraints in 53 ms.
[2020-06-03 12:44:02] [INFO ] Added : 283 causal constraints over 58 iterations in 4927 ms. Result :sat
[2020-06-03 12:44:02] [INFO ] [Real]Absence check using 39 positive place invariants in 44 ms returned sat
[2020-06-03 12:44:02] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 34 ms returned sat
[2020-06-03 12:44:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 12:44:03] [INFO ] [Real]Absence check using state equation in 996 ms returned sat
[2020-06-03 12:44:03] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 12:44:03] [INFO ] [Nat]Absence check using 39 positive place invariants in 81 ms returned sat
[2020-06-03 12:44:03] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 47 ms returned sat
[2020-06-03 12:44:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 12:44:04] [INFO ] [Nat]Absence check using state equation in 1102 ms returned sat
[2020-06-03 12:44:05] [INFO ] Deduced a trap composed of 16 places in 239 ms
[2020-06-03 12:44:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 303 ms
[2020-06-03 12:44:05] [INFO ] Computed and/alt/rep : 349/847/349 causal constraints in 47 ms.
[2020-06-03 12:44:10] [INFO ] Added : 320 causal constraints over 65 iterations in 5004 ms. Result :sat
[2020-06-03 12:44:10] [INFO ] [Real]Absence check using 39 positive place invariants in 87 ms returned sat
[2020-06-03 12:44:10] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 82 ms returned sat
[2020-06-03 12:44:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 12:44:11] [INFO ] [Real]Absence check using state equation in 904 ms returned sat
[2020-06-03 12:44:11] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 12:44:11] [INFO ] [Nat]Absence check using 39 positive place invariants in 61 ms returned sat
[2020-06-03 12:44:11] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 63 ms returned sat
[2020-06-03 12:44:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 12:44:12] [INFO ] [Nat]Absence check using state equation in 952 ms returned sat
[2020-06-03 12:44:13] [INFO ] Deduced a trap composed of 55 places in 291 ms
[2020-06-03 12:44:13] [INFO ] Deduced a trap composed of 52 places in 241 ms
[2020-06-03 12:44:13] [INFO ] Deduced a trap composed of 60 places in 224 ms
[2020-06-03 12:44:13] [INFO ] Deduced a trap composed of 43 places in 231 ms
[2020-06-03 12:44:13] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1190 ms
[2020-06-03 12:44:13] [INFO ] Computed and/alt/rep : 349/847/349 causal constraints in 37 ms.
[2020-06-03 12:44:18] [INFO ] Added : 306 causal constraints over 62 iterations in 4559 ms. Result :sat
[2020-06-03 12:44:18] [INFO ] Deduced a trap composed of 60 places in 246 ms
[2020-06-03 12:44:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 396 ms
[2020-06-03 12:44:18] [INFO ] [Real]Absence check using 39 positive place invariants in 45 ms returned sat
[2020-06-03 12:44:19] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 35 ms returned sat
[2020-06-03 12:44:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 12:44:19] [INFO ] [Real]Absence check using state equation in 927 ms returned sat
[2020-06-03 12:44:20] [INFO ] Deduced a trap composed of 8 places in 177 ms
[2020-06-03 12:44:20] [INFO ] Deduced a trap composed of 14 places in 128 ms
[2020-06-03 12:44:20] [INFO ] Deduced a trap composed of 14 places in 122 ms
[2020-06-03 12:44:20] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 586 ms
[2020-06-03 12:44:20] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 12:44:20] [INFO ] [Nat]Absence check using 39 positive place invariants in 63 ms returned sat
[2020-06-03 12:44:20] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 76 ms returned sat
[2020-06-03 12:44:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 12:44:21] [INFO ] [Nat]Absence check using state equation in 1076 ms returned sat
[2020-06-03 12:44:22] [INFO ] Deduced a trap composed of 17 places in 270 ms
[2020-06-03 12:44:22] [INFO ] Deduced a trap composed of 14 places in 201 ms
[2020-06-03 12:44:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 586 ms
[2020-06-03 12:44:22] [INFO ] Computed and/alt/rep : 349/847/349 causal constraints in 47 ms.
[2020-06-03 12:44:27] [INFO ] Added : 335 causal constraints over 67 iterations in 5198 ms. Result :sat
[2020-06-03 12:44:27] [INFO ] Deduced a trap composed of 58 places in 227 ms
[2020-06-03 12:44:28] [INFO ] Deduced a trap composed of 58 places in 207 ms
[2020-06-03 12:44:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 641 ms
[2020-06-03 12:44:28] [INFO ] [Real]Absence check using 39 positive place invariants in 47 ms returned sat
[2020-06-03 12:44:28] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 36 ms returned sat
[2020-06-03 12:44:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 12:44:29] [INFO ] [Real]Absence check using state equation in 979 ms returned sat
[2020-06-03 12:44:29] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 12:44:29] [INFO ] [Nat]Absence check using 39 positive place invariants in 64 ms returned sat
[2020-06-03 12:44:29] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 45 ms returned sat
[2020-06-03 12:44:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 12:44:30] [INFO ] [Nat]Absence check using state equation in 1094 ms returned sat
[2020-06-03 12:44:31] [INFO ] Deduced a trap composed of 14 places in 158 ms
[2020-06-03 12:44:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 237 ms
[2020-06-03 12:44:31] [INFO ] Computed and/alt/rep : 349/847/349 causal constraints in 43 ms.
[2020-06-03 12:44:36] [INFO ] Added : 335 causal constraints over 67 iterations in 5534 ms. Result :sat
[2020-06-03 12:44:36] [INFO ] [Real]Absence check using 39 positive place invariants in 53 ms returned sat
[2020-06-03 12:44:36] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 42 ms returned sat
[2020-06-03 12:44:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 12:44:37] [INFO ] [Real]Absence check using state equation in 946 ms returned sat
[2020-06-03 12:44:37] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 12:44:38] [INFO ] [Nat]Absence check using 39 positive place invariants in 77 ms returned sat
[2020-06-03 12:44:38] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 60 ms returned sat
[2020-06-03 12:44:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 12:44:39] [INFO ] [Nat]Absence check using state equation in 1311 ms returned sat
[2020-06-03 12:44:39] [INFO ] Deduced a trap composed of 35 places in 295 ms
[2020-06-03 12:44:40] [INFO ] Deduced a trap composed of 20 places in 252 ms
[2020-06-03 12:44:40] [INFO ] Deduced a trap composed of 40 places in 254 ms
[2020-06-03 12:44:40] [INFO ] Deduced a trap composed of 18 places in 147 ms
[2020-06-03 12:44:40] [INFO ] Deduced a trap composed of 14 places in 136 ms
[2020-06-03 12:44:40] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1415 ms
[2020-06-03 12:44:40] [INFO ] Computed and/alt/rep : 349/847/349 causal constraints in 35 ms.
[2020-06-03 12:44:46] [INFO ] Added : 308 causal constraints over 63 iterations in 5149 ms. Result :sat
[2020-06-03 12:44:46] [INFO ] Deduced a trap composed of 53 places in 165 ms
[2020-06-03 12:44:46] [INFO ] Deduced a trap composed of 51 places in 165 ms
[2020-06-03 12:44:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 579 ms
[2020-06-03 12:44:46] [INFO ] [Real]Absence check using 39 positive place invariants in 44 ms returned sat
[2020-06-03 12:44:46] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 39 ms returned sat
[2020-06-03 12:44:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 12:44:47] [INFO ] [Real]Absence check using state equation in 835 ms returned sat
[2020-06-03 12:44:47] [INFO ] Deduced a trap composed of 9 places in 224 ms
[2020-06-03 12:44:48] [INFO ] Deduced a trap composed of 17 places in 273 ms
[2020-06-03 12:44:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 611 ms
[2020-06-03 12:44:48] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 12:44:48] [INFO ] [Nat]Absence check using 39 positive place invariants in 63 ms returned sat
[2020-06-03 12:44:48] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 44 ms returned sat
[2020-06-03 12:44:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 12:44:49] [INFO ] [Nat]Absence check using state equation in 1100 ms returned sat
[2020-06-03 12:44:49] [INFO ] Deduced a trap composed of 8 places in 144 ms
[2020-06-03 12:44:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 219 ms
[2020-06-03 12:44:49] [INFO ] Computed and/alt/rep : 349/847/349 causal constraints in 65 ms.
[2020-06-03 12:44:54] [INFO ] Added : 328 causal constraints over 67 iterations in 4699 ms. Result :sat
[2020-06-03 12:44:54] [INFO ] [Real]Absence check using 39 positive place invariants in 55 ms returned sat
[2020-06-03 12:44:54] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 35 ms returned sat
[2020-06-03 12:44:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 12:44:55] [INFO ] [Real]Absence check using state equation in 809 ms returned sat
[2020-06-03 12:44:56] [INFO ] Deduced a trap composed of 22 places in 243 ms
[2020-06-03 12:44:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 323 ms
[2020-06-03 12:44:56] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 12:44:56] [INFO ] [Nat]Absence check using 39 positive place invariants in 63 ms returned sat
[2020-06-03 12:44:56] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 33 ms returned sat
[2020-06-03 12:44:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 12:44:57] [INFO ] [Nat]Absence check using state equation in 894 ms returned sat
[2020-06-03 12:44:57] [INFO ] Deduced a trap composed of 25 places in 306 ms
[2020-06-03 12:44:57] [INFO ] Deduced a trap composed of 17 places in 183 ms
[2020-06-03 12:44:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 621 ms
[2020-06-03 12:44:57] [INFO ] Computed and/alt/rep : 349/847/349 causal constraints in 37 ms.
[2020-06-03 12:45:02] [INFO ] Added : 316 causal constraints over 64 iterations in 4349 ms. Result :sat
[2020-06-03 12:45:02] [INFO ] Deduced a trap composed of 44 places in 166 ms
[2020-06-03 12:45:02] [INFO ] Deduced a trap composed of 54 places in 145 ms
[2020-06-03 12:45:02] [INFO ] Deduced a trap composed of 27 places in 183 ms
[2020-06-03 12:45:02] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 803 ms
[2020-06-03 12:45:03] [INFO ] [Real]Absence check using 39 positive place invariants in 43 ms returned sat
[2020-06-03 12:45:03] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 36 ms returned sat
[2020-06-03 12:45:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 12:45:04] [INFO ] [Real]Absence check using state equation in 967 ms returned sat
[2020-06-03 12:45:04] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 12:45:04] [INFO ] [Nat]Absence check using 39 positive place invariants in 132 ms returned sat
[2020-06-03 12:45:04] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 98 ms returned sat
[2020-06-03 12:45:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 12:45:05] [INFO ] [Nat]Absence check using state equation in 1259 ms returned sat
[2020-06-03 12:45:06] [INFO ] Deduced a trap composed of 12 places in 280 ms
[2020-06-03 12:45:06] [INFO ] Deduced a trap composed of 13 places in 230 ms
[2020-06-03 12:45:06] [INFO ] Deduced a trap composed of 29 places in 529 ms
[2020-06-03 12:45:06] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1241 ms
[2020-06-03 12:45:07] [INFO ] Computed and/alt/rep : 349/847/349 causal constraints in 114 ms.
[2020-06-03 12:45:11] [INFO ] Added : 288 causal constraints over 59 iterations in 4819 ms. Result :sat
[2020-06-03 12:45:11] [INFO ] [Real]Absence check using 39 positive place invariants in 57 ms returned sat
[2020-06-03 12:45:12] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 36 ms returned sat
[2020-06-03 12:45:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 12:45:12] [INFO ] [Real]Absence check using state equation in 915 ms returned sat
[2020-06-03 12:45:13] [INFO ] Deduced a trap composed of 8 places in 186 ms
[2020-06-03 12:45:13] [INFO ] Deduced a trap composed of 14 places in 163 ms
[2020-06-03 12:45:13] [INFO ] Deduced a trap composed of 16 places in 52 ms
[2020-06-03 12:45:13] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 561 ms
[2020-06-03 12:45:13] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 12:45:13] [INFO ] [Nat]Absence check using 39 positive place invariants in 62 ms returned sat
[2020-06-03 12:45:13] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 47 ms returned sat
[2020-06-03 12:45:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 12:45:14] [INFO ] [Nat]Absence check using state equation in 842 ms returned sat
[2020-06-03 12:45:14] [INFO ] Deduced a trap composed of 13 places in 216 ms
[2020-06-03 12:45:15] [INFO ] Deduced a trap composed of 10 places in 206 ms
[2020-06-03 12:45:15] [INFO ] Deduced a trap composed of 14 places in 200 ms
[2020-06-03 12:45:15] [INFO ] Deduced a trap composed of 57 places in 198 ms
[2020-06-03 12:45:15] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1073 ms
[2020-06-03 12:45:15] [INFO ] Computed and/alt/rep : 349/847/349 causal constraints in 47 ms.
[2020-06-03 12:45:20] [INFO ] Added : 333 causal constraints over 68 iterations in 4395 ms. Result :sat
[2020-06-03 12:45:20] [INFO ] [Real]Absence check using 39 positive place invariants in 44 ms returned sat
[2020-06-03 12:45:20] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 40 ms returned sat
[2020-06-03 12:45:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 12:45:21] [INFO ] [Real]Absence check using state equation in 818 ms returned sat
[2020-06-03 12:45:21] [INFO ] Deduced a trap composed of 23 places in 280 ms
[2020-06-03 12:45:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 367 ms
[2020-06-03 12:45:21] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 12:45:21] [INFO ] [Nat]Absence check using 39 positive place invariants in 62 ms returned sat
[2020-06-03 12:45:21] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 102 ms returned sat
[2020-06-03 12:45:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 12:45:22] [INFO ] [Nat]Absence check using state equation in 1139 ms returned sat
[2020-06-03 12:45:23] [INFO ] Deduced a trap composed of 23 places in 302 ms
[2020-06-03 12:45:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 390 ms
[2020-06-03 12:45:23] [INFO ] Computed and/alt/rep : 349/847/349 causal constraints in 40 ms.
[2020-06-03 12:45:28] [INFO ] Added : 287 causal constraints over 59 iterations in 4791 ms. Result :sat
[2020-06-03 12:45:28] [INFO ] Deduced a trap composed of 54 places in 579 ms
[2020-06-03 12:45:29] [INFO ] Deduced a trap composed of 56 places in 245 ms
[2020-06-03 12:45:29] [INFO ] Deduced a trap composed of 64 places in 160 ms
[2020-06-03 12:45:29] [INFO ] Deduced a trap composed of 56 places in 156 ms
[2020-06-03 12:45:29] [INFO ] Deduced a trap composed of 53 places in 277 ms
[2020-06-03 12:45:30] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1914 ms
[2020-06-03 12:45:30] [INFO ] [Real]Absence check using 39 positive place invariants in 43 ms returned sat
[2020-06-03 12:45:30] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 38 ms returned sat
[2020-06-03 12:45:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 12:45:31] [INFO ] [Real]Absence check using state equation in 810 ms returned sat
[2020-06-03 12:45:31] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 12:45:31] [INFO ] [Nat]Absence check using 39 positive place invariants in 64 ms returned sat
[2020-06-03 12:45:31] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 93 ms returned sat
[2020-06-03 12:45:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 12:45:32] [INFO ] [Nat]Absence check using state equation in 939 ms returned sat
[2020-06-03 12:45:32] [INFO ] Deduced a trap composed of 8 places in 282 ms
[2020-06-03 12:45:32] [INFO ] Deduced a trap composed of 14 places in 167 ms
[2020-06-03 12:45:32] [INFO ] Deduced a trap composed of 32 places in 173 ms
[2020-06-03 12:45:32] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 764 ms
[2020-06-03 12:45:33] [INFO ] Computed and/alt/rep : 349/847/349 causal constraints in 60 ms.
[2020-06-03 12:45:36] [INFO ] Added : 242 causal constraints over 49 iterations in 3840 ms. Result :sat
[2020-06-03 12:45:37] [INFO ] Deduced a trap composed of 49 places in 224 ms
[2020-06-03 12:45:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 331 ms
[2020-06-03 12:45:37] [INFO ] [Real]Absence check using 39 positive place invariants in 52 ms returned sat
[2020-06-03 12:45:37] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 46 ms returned sat
[2020-06-03 12:45:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 12:45:38] [INFO ] [Real]Absence check using state equation in 830 ms returned sat
[2020-06-03 12:45:38] [INFO ] Deduced a trap composed of 34 places in 289 ms
[2020-06-03 12:45:38] [INFO ] Deduced a trap composed of 17 places in 126 ms
[2020-06-03 12:45:38] [INFO ] Deduced a trap composed of 21 places in 115 ms
[2020-06-03 12:45:39] [INFO ] Deduced a trap composed of 20 places in 128 ms
[2020-06-03 12:45:39] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 847 ms
[2020-06-03 12:45:39] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 12:45:39] [INFO ] [Nat]Absence check using 39 positive place invariants in 75 ms returned sat
[2020-06-03 12:45:39] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 93 ms returned sat
[2020-06-03 12:45:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 12:45:40] [INFO ] [Nat]Absence check using state equation in 1027 ms returned sat
[2020-06-03 12:45:40] [INFO ] Deduced a trap composed of 35 places in 207 ms
[2020-06-03 12:45:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 281 ms
[2020-06-03 12:45:40] [INFO ] Computed and/alt/rep : 349/847/349 causal constraints in 38 ms.
[2020-06-03 12:45:44] [INFO ] Added : 249 causal constraints over 51 iterations in 3758 ms. Result :sat
[2020-06-03 12:45:44] [INFO ] Deduced a trap composed of 40 places in 227 ms
[2020-06-03 12:45:45] [INFO ] Deduced a trap composed of 55 places in 224 ms
[2020-06-03 12:45:45] [INFO ] Deduced a trap composed of 42 places in 168 ms
[2020-06-03 12:45:45] [INFO ] Deduced a trap composed of 30 places in 91 ms
[2020-06-03 12:45:45] [INFO ] Deduced a trap composed of 53 places in 178 ms
[2020-06-03 12:45:45] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1385 ms
[2020-06-03 12:45:45] [INFO ] [Real]Absence check using 39 positive place invariants in 51 ms returned sat
[2020-06-03 12:45:45] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 34 ms returned sat
[2020-06-03 12:45:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 12:45:46] [INFO ] [Real]Absence check using state equation in 857 ms returned sat
[2020-06-03 12:45:46] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 12:45:47] [INFO ] [Nat]Absence check using 39 positive place invariants in 80 ms returned sat
[2020-06-03 12:45:47] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 146 ms returned sat
[2020-06-03 12:45:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 12:45:48] [INFO ] [Nat]Absence check using state equation in 899 ms returned sat
[2020-06-03 12:45:48] [INFO ] Computed and/alt/rep : 349/847/349 causal constraints in 40 ms.
[2020-06-03 12:45:52] [INFO ] Added : 286 causal constraints over 58 iterations in 4202 ms. Result :sat
[2020-06-03 12:45:52] [INFO ] Deduced a trap composed of 34 places in 228 ms
[2020-06-03 12:45:52] [INFO ] Deduced a trap composed of 54 places in 195 ms
[2020-06-03 12:45:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 718 ms
[2020-06-03 12:45:53] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2020-06-03 12:45:53] [INFO ] Flatten gal took : 206 ms
FORMULA DES-PT-30b-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-30b-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-30b-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-30b-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-30b-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 12:45:53] [INFO ] Applying decomposition
[2020-06-03 12:45:53] [INFO ] Flatten gal took : 76 ms
[2020-06-03 12:45:53] [INFO ] Decomposing Gal with order
[2020-06-03 12:45:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-06-03 12:45:54] [INFO ] Removed a total of 137 redundant transitions.
[2020-06-03 12:45:54] [INFO ] Flatten gal took : 162 ms
[2020-06-03 12:45:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 492 labels/synchronizations in 61 ms.
[2020-06-03 12:45:54] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 10 ms.
[2020-06-03 12:45:54] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 8 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ DES-PT-30b @ 3570 seconds

FORMULA DES-PT-30b-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-30b-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-30b-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-30b-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-30b-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-30b-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16427456 kB
MemFree: 11465060 kB
After kill :
MemTotal: 16427456 kB
MemFree: 11466296 kB

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itslola"
echo " Input is DES-PT-30b, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r180-ebro-158987900000282"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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