About the Execution of ITS-Tools for DES-PT-20a
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15744.330 | 3600000.00 | 3658087.00 | 13898.70 | FTFFFFFFFFF????? | 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.r051-ebro-158902545900258.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 DES-PT-20a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r051-ebro-158902545900258
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 244K
-rw-r--r-- 1 mcc users 3.6K Mar 30 01:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 30 01:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 28 16:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 16:18 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.2K Apr 8 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K 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 4.2K Mar 27 08:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 27 08:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 26 08:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K 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 57K 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-20a-00
FORMULA_NAME DES-PT-20a-01
FORMULA_NAME DES-PT-20a-02
FORMULA_NAME DES-PT-20a-03
FORMULA_NAME DES-PT-20a-04
FORMULA_NAME DES-PT-20a-05
FORMULA_NAME DES-PT-20a-06
FORMULA_NAME DES-PT-20a-07
FORMULA_NAME DES-PT-20a-08
FORMULA_NAME DES-PT-20a-09
FORMULA_NAME DES-PT-20a-10
FORMULA_NAME DES-PT-20a-11
FORMULA_NAME DES-PT-20a-12
FORMULA_NAME DES-PT-20a-13
FORMULA_NAME DES-PT-20a-14
FORMULA_NAME DES-PT-20a-15
=== Now, execution of the tool begins
BK_START 1589538404772
[2020-05-15 10:26:48] [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, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-15 10:26:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-15 10:26:48] [INFO ] Load time of PNML (sax parser for PT used): 123 ms
[2020-05-15 10:26:48] [INFO ] Transformed 195 places.
[2020-05-15 10:26:48] [INFO ] Transformed 152 transitions.
[2020-05-15 10:26:48] [INFO ] Found NUPN structural information;
[2020-05-15 10:26:48] [INFO ] Parsed PT model containing 195 places and 152 transitions in 202 ms.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 42 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 2213 resets, run finished after 749 ms. (steps per millisecond=133 ) properties seen :[0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 1, 1, 0, 1, 0, 0, 0, 1]
// Phase 1: matrix 138 rows 195 cols
[2020-05-15 10:26:49] [INFO ] Computed 59 place invariants in 29 ms
[2020-05-15 10:26:49] [INFO ] [Real]Absence check using 34 positive place invariants in 73 ms returned sat
[2020-05-15 10:26:49] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 34 ms returned sat
[2020-05-15 10:26:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 10:26:49] [INFO ] [Real]Absence check using state equation in 251 ms returned sat
[2020-05-15 10:26:49] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 10:26:49] [INFO ] [Nat]Absence check using 34 positive place invariants in 39 ms returned sat
[2020-05-15 10:26:50] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 94 ms returned sat
[2020-05-15 10:26:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 10:26:50] [INFO ] [Nat]Absence check using state equation in 337 ms returned sat
[2020-05-15 10:26:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2020-05-15 10:26:50] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2020-05-15 10:26:50] [INFO ] Computed and/alt/rep : 137/544/137 causal constraints in 41 ms.
[2020-05-15 10:26:51] [INFO ] Added : 132 causal constraints over 27 iterations in 987 ms. Result :sat
[2020-05-15 10:26:51] [INFO ] Deduced a trap composed of 13 places in 141 ms
[2020-05-15 10:26:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 220 ms
[2020-05-15 10:26:51] [INFO ] [Real]Absence check using 34 positive place invariants in 46 ms returned sat
[2020-05-15 10:26:51] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 25 ms returned sat
[2020-05-15 10:26:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 10:26:52] [INFO ] [Real]Absence check using state equation in 265 ms returned sat
[2020-05-15 10:26:52] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 10:26:52] [INFO ] [Nat]Absence check using 34 positive place invariants in 29 ms returned sat
[2020-05-15 10:26:52] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 65 ms returned sat
[2020-05-15 10:26:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 10:26:52] [INFO ] [Nat]Absence check using state equation in 530 ms returned sat
[2020-05-15 10:26:52] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2020-05-15 10:26:52] [INFO ] Deduced a trap composed of 9 places in 99 ms
[2020-05-15 10:26:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 139 ms
[2020-05-15 10:26:52] [INFO ] Computed and/alt/rep : 137/544/137 causal constraints in 24 ms.
[2020-05-15 10:26:53] [INFO ] Added : 122 causal constraints over 25 iterations in 986 ms. Result :sat
[2020-05-15 10:26:54] [INFO ] Deduced a trap composed of 16 places in 142 ms
[2020-05-15 10:26:54] [INFO ] Deduced a trap composed of 18 places in 109 ms
[2020-05-15 10:26:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 369 ms
[2020-05-15 10:26:54] [INFO ] [Real]Absence check using 34 positive place invariants in 59 ms returned sat
[2020-05-15 10:26:54] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 23 ms returned sat
[2020-05-15 10:26:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 10:26:54] [INFO ] [Real]Absence check using state equation in 595 ms returned sat
[2020-05-15 10:26:55] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 10:26:55] [INFO ] [Nat]Absence check using 34 positive place invariants in 29 ms returned sat
[2020-05-15 10:26:55] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 76 ms returned sat
[2020-05-15 10:26:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 10:26:55] [INFO ] [Nat]Absence check using state equation in 366 ms returned sat
[2020-05-15 10:26:55] [INFO ] [Nat]Added 1 Read/Feed constraints in 7 ms returned sat
[2020-05-15 10:26:55] [INFO ] Computed and/alt/rep : 137/544/137 causal constraints in 36 ms.
[2020-05-15 10:26:56] [INFO ] Added : 99 causal constraints over 20 iterations in 821 ms. Result :sat
[2020-05-15 10:26:56] [INFO ] [Real]Absence check using 34 positive place invariants in 41 ms returned sat
[2020-05-15 10:26:56] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 26 ms returned sat
[2020-05-15 10:26:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 10:26:56] [INFO ] [Real]Absence check using state equation in 394 ms returned sat
[2020-05-15 10:26:56] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 10:26:57] [INFO ] [Nat]Absence check using 34 positive place invariants in 28 ms returned sat
[2020-05-15 10:26:57] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 42 ms returned sat
[2020-05-15 10:26:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 10:26:57] [INFO ] [Nat]Absence check using state equation in 375 ms returned sat
[2020-05-15 10:26:57] [INFO ] [Nat]Added 1 Read/Feed constraints in 5 ms returned sat
[2020-05-15 10:26:57] [INFO ] Computed and/alt/rep : 137/544/137 causal constraints in 30 ms.
[2020-05-15 10:26:58] [INFO ] Added : 126 causal constraints over 26 iterations in 894 ms. Result :sat
[2020-05-15 10:26:58] [INFO ] [Real]Absence check using 34 positive place invariants in 24 ms returned sat
[2020-05-15 10:26:58] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 23 ms returned sat
[2020-05-15 10:26:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 10:26:58] [INFO ] [Real]Absence check using state equation in 268 ms returned sat
[2020-05-15 10:26:58] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 10:26:58] [INFO ] [Nat]Absence check using 34 positive place invariants in 47 ms returned sat
[2020-05-15 10:26:59] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 75 ms returned sat
[2020-05-15 10:26:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 10:26:59] [INFO ] [Nat]Absence check using state equation in 454 ms returned sat
[2020-05-15 10:26:59] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2020-05-15 10:26:59] [INFO ] Computed and/alt/rep : 137/544/137 causal constraints in 25 ms.
[2020-05-15 10:27:00] [INFO ] Added : 122 causal constraints over 25 iterations in 1187 ms. Result :sat
[2020-05-15 10:27:00] [INFO ] Deduced a trap composed of 19 places in 122 ms
[2020-05-15 10:27:01] [INFO ] Deduced a trap composed of 18 places in 108 ms
[2020-05-15 10:27:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 389 ms
[2020-05-15 10:27:01] [INFO ] [Real]Absence check using 34 positive place invariants in 33 ms returned sat
[2020-05-15 10:27:01] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 32 ms returned sat
[2020-05-15 10:27:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 10:27:01] [INFO ] [Real]Absence check using state equation in 272 ms returned sat
[2020-05-15 10:27:01] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 10:27:01] [INFO ] [Nat]Absence check using 34 positive place invariants in 50 ms returned sat
[2020-05-15 10:27:01] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 88 ms returned sat
[2020-05-15 10:27:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 10:27:02] [INFO ] [Nat]Absence check using state equation in 428 ms returned sat
[2020-05-15 10:27:02] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2020-05-15 10:27:02] [INFO ] Deduced a trap composed of 9 places in 103 ms
[2020-05-15 10:27:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 137 ms
[2020-05-15 10:27:02] [INFO ] Computed and/alt/rep : 137/544/137 causal constraints in 60 ms.
[2020-05-15 10:27:03] [INFO ] Added : 98 causal constraints over 20 iterations in 891 ms. Result :sat
[2020-05-15 10:27:03] [INFO ] [Real]Absence check using 34 positive place invariants in 39 ms returned sat
[2020-05-15 10:27:03] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 23 ms returned sat
[2020-05-15 10:27:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 10:27:03] [INFO ] [Real]Absence check using state equation in 441 ms returned sat
[2020-05-15 10:27:03] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 10:27:03] [INFO ] [Nat]Absence check using 34 positive place invariants in 85 ms returned sat
[2020-05-15 10:27:04] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 91 ms returned sat
[2020-05-15 10:27:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 10:27:04] [INFO ] [Nat]Absence check using state equation in 539 ms returned sat
[2020-05-15 10:27:04] [INFO ] [Nat]Added 1 Read/Feed constraints in 11 ms returned sat
[2020-05-15 10:27:04] [INFO ] Computed and/alt/rep : 137/544/137 causal constraints in 29 ms.
[2020-05-15 10:27:05] [INFO ] Added : 82 causal constraints over 17 iterations in 729 ms. Result :sat
[2020-05-15 10:27:05] [INFO ] [Real]Absence check using 34 positive place invariants in 30 ms returned sat
[2020-05-15 10:27:05] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 44 ms returned sat
[2020-05-15 10:27:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 10:27:05] [INFO ] [Real]Absence check using state equation in 310 ms returned sat
[2020-05-15 10:27:05] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 10:27:05] [INFO ] [Nat]Absence check using 34 positive place invariants in 29 ms returned sat
[2020-05-15 10:27:06] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 94 ms returned sat
[2020-05-15 10:27:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 10:27:06] [INFO ] [Nat]Absence check using state equation in 327 ms returned sat
[2020-05-15 10:27:06] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2020-05-15 10:27:06] [INFO ] Computed and/alt/rep : 137/544/137 causal constraints in 26 ms.
[2020-05-15 10:27:07] [INFO ] Added : 133 causal constraints over 28 iterations in 1242 ms. Result :sat
[2020-05-15 10:27:07] [INFO ] [Real]Absence check using 34 positive place invariants in 25 ms returned sat
[2020-05-15 10:27:07] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 34 ms returned sat
[2020-05-15 10:27:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 10:27:08] [INFO ] [Real]Absence check using state equation in 506 ms returned sat
[2020-05-15 10:27:08] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 10:27:08] [INFO ] [Nat]Absence check using 34 positive place invariants in 36 ms returned sat
[2020-05-15 10:27:08] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 75 ms returned sat
[2020-05-15 10:27:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 10:27:09] [INFO ] [Nat]Absence check using state equation in 627 ms returned sat
[2020-05-15 10:27:09] [INFO ] [Nat]Added 1 Read/Feed constraints in 8 ms returned sat
[2020-05-15 10:27:09] [INFO ] Computed and/alt/rep : 137/544/137 causal constraints in 61 ms.
[2020-05-15 10:27:10] [INFO ] Added : 128 causal constraints over 26 iterations in 1021 ms. Result :sat
[2020-05-15 10:27:10] [INFO ] [Real]Absence check using 34 positive place invariants in 34 ms returned sat
[2020-05-15 10:27:10] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 29 ms returned sat
[2020-05-15 10:27:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 10:27:10] [INFO ] [Real]Absence check using state equation in 261 ms returned sat
[2020-05-15 10:27:10] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 10:27:10] [INFO ] [Nat]Absence check using 34 positive place invariants in 41 ms returned sat
[2020-05-15 10:27:10] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 81 ms returned sat
[2020-05-15 10:27:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 10:27:11] [INFO ] [Nat]Absence check using state equation in 554 ms returned sat
[2020-05-15 10:27:11] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2020-05-15 10:27:11] [INFO ] Computed and/alt/rep : 137/544/137 causal constraints in 27 ms.
[2020-05-15 10:27:12] [INFO ] Added : 128 causal constraints over 26 iterations in 916 ms. Result :sat
[2020-05-15 10:27:12] [INFO ] [Real]Absence check using 34 positive place invariants in 53 ms returned sat
[2020-05-15 10:27:12] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 24 ms returned sat
[2020-05-15 10:27:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 10:27:12] [INFO ] [Real]Absence check using state equation in 249 ms returned sat
[2020-05-15 10:27:12] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 10:27:12] [INFO ] [Nat]Absence check using 34 positive place invariants in 38 ms returned sat
[2020-05-15 10:27:13] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 697 ms returned sat
[2020-05-15 10:27:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 10:27:14] [INFO ] [Nat]Absence check using state equation in 503 ms returned sat
[2020-05-15 10:27:14] [INFO ] [Nat]Added 1 Read/Feed constraints in 8 ms returned sat
[2020-05-15 10:27:14] [INFO ] Computed and/alt/rep : 137/544/137 causal constraints in 26 ms.
[2020-05-15 10:27:14] [INFO ] Added : 109 causal constraints over 22 iterations in 933 ms. Result :sat
[2020-05-15 10:27:15] [INFO ] [Real]Absence check using 34 positive place invariants in 27 ms returned sat
[2020-05-15 10:27:15] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 21 ms returned sat
[2020-05-15 10:27:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 10:27:15] [INFO ] [Real]Absence check using state equation in 261 ms returned sat
[2020-05-15 10:27:15] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 10:27:15] [INFO ] [Nat]Absence check using 34 positive place invariants in 55 ms returned sat
[2020-05-15 10:27:15] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 135 ms returned sat
[2020-05-15 10:27:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 10:27:15] [INFO ] [Nat]Absence check using state equation in 344 ms returned sat
[2020-05-15 10:27:15] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2020-05-15 10:27:16] [INFO ] Deduced a trap composed of 9 places in 91 ms
[2020-05-15 10:27:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 123 ms
[2020-05-15 10:27:16] [INFO ] Computed and/alt/rep : 137/544/137 causal constraints in 21 ms.
[2020-05-15 10:27:16] [INFO ] Added : 108 causal constraints over 23 iterations in 763 ms. Result :sat
[2020-05-15 10:27:16] [INFO ] Deduced a trap composed of 10 places in 75 ms
[2020-05-15 10:27:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 136 ms
[2020-05-15 10:27:17] [INFO ] [Real]Absence check using 34 positive place invariants in 28 ms returned sat
[2020-05-15 10:27:17] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 26 ms returned sat
[2020-05-15 10:27:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 10:27:17] [INFO ] [Real]Absence check using state equation in 267 ms returned sat
[2020-05-15 10:27:17] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 10:27:17] [INFO ] [Nat]Absence check using 34 positive place invariants in 27 ms returned sat
[2020-05-15 10:27:17] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 54 ms returned sat
[2020-05-15 10:27:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 10:27:17] [INFO ] [Nat]Absence check using state equation in 420 ms returned sat
[2020-05-15 10:27:17] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2020-05-15 10:27:18] [INFO ] Computed and/alt/rep : 137/544/137 causal constraints in 21 ms.
[2020-05-15 10:27:18] [INFO ] Added : 108 causal constraints over 22 iterations in 841 ms. Result :sat
[2020-05-15 10:27:18] [INFO ] [Real]Absence check using 34 positive place invariants in 29 ms returned sat
[2020-05-15 10:27:18] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 24 ms returned sat
[2020-05-15 10:27:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 10:27:19] [INFO ] [Real]Absence check using state equation in 493 ms returned sat
[2020-05-15 10:27:19] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 10:27:19] [INFO ] [Nat]Absence check using 34 positive place invariants in 28 ms returned sat
[2020-05-15 10:27:19] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 53 ms returned sat
[2020-05-15 10:27:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 10:27:20] [INFO ] [Nat]Absence check using state equation in 418 ms returned sat
[2020-05-15 10:27:20] [INFO ] [Nat]Added 1 Read/Feed constraints in 5 ms returned sat
[2020-05-15 10:27:20] [INFO ] Computed and/alt/rep : 137/544/137 causal constraints in 25 ms.
[2020-05-15 10:27:21] [INFO ] Added : 133 causal constraints over 27 iterations in 1197 ms. Result :sat
[2020-05-15 10:27:21] [INFO ] [Real]Absence check using 34 positive place invariants in 25 ms returned sat
[2020-05-15 10:27:21] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 21 ms returned sat
[2020-05-15 10:27:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 10:27:21] [INFO ] [Real]Absence check using state equation in 259 ms returned sat
[2020-05-15 10:27:21] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 10:27:21] [INFO ] [Nat]Absence check using 34 positive place invariants in 38 ms returned sat
[2020-05-15 10:27:21] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 70 ms returned sat
[2020-05-15 10:27:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 10:27:22] [INFO ] [Nat]Absence check using state equation in 358 ms returned sat
[2020-05-15 10:27:22] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2020-05-15 10:27:22] [INFO ] Computed and/alt/rep : 137/544/137 causal constraints in 17 ms.
[2020-05-15 10:27:23] [INFO ] Added : 127 causal constraints over 26 iterations in 1015 ms. Result :sat
[2020-05-15 10:27:23] [INFO ] [Real]Absence check using 34 positive place invariants in 30 ms returned sat
[2020-05-15 10:27:23] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 21 ms returned sat
[2020-05-15 10:27:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 10:27:23] [INFO ] [Real]Absence check using state equation in 276 ms returned sat
[2020-05-15 10:27:23] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 10:27:23] [INFO ] [Nat]Absence check using 34 positive place invariants in 35 ms returned sat
[2020-05-15 10:27:23] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 59 ms returned sat
[2020-05-15 10:27:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 10:27:24] [INFO ] [Nat]Absence check using state equation in 441 ms returned sat
[2020-05-15 10:27:24] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2020-05-15 10:27:24] [INFO ] Computed and/alt/rep : 137/544/137 causal constraints in 21 ms.
[2020-05-15 10:27:25] [INFO ] Added : 122 causal constraints over 25 iterations in 1030 ms. Result :sat
[2020-05-15 10:27:25] [INFO ] Deduced a trap composed of 19 places in 115 ms
[2020-05-15 10:27:25] [INFO ] Deduced a trap composed of 18 places in 77 ms
[2020-05-15 10:27:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 325 ms
[2020-05-15 10:27:25] [INFO ] [Real]Absence check using 34 positive place invariants in 25 ms returned sat
[2020-05-15 10:27:25] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 23 ms returned sat
[2020-05-15 10:27:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 10:27:26] [INFO ] [Real]Absence check using state equation in 268 ms returned sat
[2020-05-15 10:27:26] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 10:27:26] [INFO ] [Nat]Absence check using 34 positive place invariants in 33 ms returned sat
[2020-05-15 10:27:26] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 70 ms returned sat
[2020-05-15 10:27:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 10:27:26] [INFO ] [Nat]Absence check using state equation in 352 ms returned sat
[2020-05-15 10:27:26] [INFO ] [Nat]Added 1 Read/Feed constraints in 5 ms returned sat
[2020-05-15 10:27:26] [INFO ] Computed and/alt/rep : 137/544/137 causal constraints in 23 ms.
[2020-05-15 10:27:27] [INFO ] Added : 91 causal constraints over 19 iterations in 709 ms. Result :sat
[2020-05-15 10:27:27] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-05-15 10:27:27] [INFO ] Flatten gal took : 147 ms
FORMULA DES-PT-20a-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-15 10:27:27] [INFO ] Flatten gal took : 43 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-15 10:27:28] [INFO ] Applying decomposition
[2020-05-15 10:27:28] [INFO ] Flatten gal took : 61 ms
[2020-05-15 10:27:28] [INFO ] Input system was already deterministic with 138 transitions.
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/graph4626138941344002261.txt, -o, /tmp/graph4626138941344002261.bin, -w, /tmp/graph4626138941344002261.weights], workingDir=null]
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 138 rows 195 cols
[2020-05-15 10:27:28] [INFO ] Computed 59 place invariants in 19 ms
inv : p0 + p162 + p163 + p170 + p171 = 1
inv : p0 + p148 + p149 = 1
inv : p0 + p122 + p135 - p139 + p151 + p155 - p167 = 1
inv : p0 + p138 + p139 = 1
inv : p0 + p132 + p135 - p149 + p151 + p165 - p167 = 1
inv : p168 + p169 - p170 - p171 = 0
inv : p0 + p185 + p186 + p187 + p188 + p189 = 1
inv : p0 + p90 + p91 = 1
inv : p0 + p190 + p191 + p192 = 1
inv : p0 + p166 + p167 + p170 + p171 = 1
inv : p0 + p85 + p86 + p87 = 1
inv : p0 + p164 + p165 + p170 + p171 = 1
inv : p0 + p130 + p135 - p147 + p151 + p163 - p167 = 1
inv : p125 - p135 + p141 - p151 - p157 + p167 = 0
inv : p0 + p110 + p111 = 1
inv : p0 + p146 + p147 = 1
inv : p121 - p135 + p137 - p151 - p153 + p167 = 0
inv : p0 + p124 + p135 - p141 + p151 + p157 - p167 = 1
inv : p0 + p156 + p157 + p170 + p171 = 1
inv : 3*p0 + 40*p1 + 2*p2 + 4*p3 + 6*p4 + 8*p5 + 10*p6 + 12*p7 + 14*p8 + 16*p9 + 18*p10 + 20*p11 + 22*p12 + 24*p13 + 26*p14 + 28*p15 + 30*p16 + 32*p17 + 34*p18 + 36*p19 + 38*p20 - 40*p21 - 2*p22 - 4*p23 - 6*p24 - 8*p25 - 10*p26 - 12*p27 - 14*p28 - 16*p29 - 18*p30 - 20*p31 - 22*p32 - 24*p33 - 26*p34 - 28*p35 - 30*p36 - 32*p37 - 34*p38 - 36*p39 - 38*p40 - p113 - p115 - p119 - p175 - p177 - p178 + p180 - p183 + p185 + p189 + 2*p190 + p192 + p194 = 3
inv : p133 - p135 + p149 - p151 - p165 + p167 = 0
inv : p0 + p190 + p193 + p194 = 1
inv : p0 + p172 + p173 = 1
inv : p123 - p135 + p139 - p151 - p155 + p167 = 0
inv : p0 + p93 + p94 = 1
inv : p0 + p108 + p109 = 1
inv : p0 + p140 + p141 = 1
inv : p0 + p126 + p135 - p143 + p151 + p159 - p167 = 1
inv : p0 + p160 + p161 + p170 + p171 = 1
inv : 3*p0 + 20*p1 + p2 + 2*p3 + 3*p4 + 4*p5 + 5*p6 + 6*p7 + 7*p8 + 8*p9 + 9*p10 + 10*p11 + 11*p12 + 12*p13 + 13*p14 + 14*p15 + 15*p16 + 16*p17 + 17*p18 + 18*p19 + 19*p20 - 20*p21 - p22 - 2*p23 - 3*p24 - 4*p25 - 5*p26 - 6*p27 - 7*p28 - 8*p29 - 9*p30 - 10*p31 - 11*p32 - 12*p33 - 13*p34 - 14*p35 - 15*p36 - 16*p37 - 17*p38 - 18*p39 - 19*p40 - p113 + p116 - p135 - p151 + p167 + p170 - p173 - p175 - p177 - p181 + p190 + p192 = 3
inv : p0 + p134 + p135 = 1
inv : -20*p1 - p2 - 2*p3 - 3*p4 - 4*p5 - 5*p6 - 6*p7 - 7*p8 - 8*p9 - 9*p10 - 10*p11 - 11*p12 - 12*p13 - 13*p14 - 14*p15 - 15*p16 - 16*p17 - 17*p18 - 18*p19 - 19*p20 + 20*p21 + p22 + 2*p23 + 3*p24 + 4*p25 + 5*p26 + 6*p27 + 7*p28 + 8*p29 + 9*p30 + 10*p31 + 11*p32 + 12*p33 + 13*p34 + 14*p35 + 15*p36 + 16*p37 + 17*p38 + 18*p39 + 19*p40 + p88 + p91 + p115 + p119 + p174 + p175 + p177 + p178 + p183 + p184 - p185 - p190 - p192 = 0
inv : p0 + p144 + p145 = 1
inv : p0 + p128 + p135 - p145 + p151 + p161 - p167 = 1
inv : p0 - 40*p1 - 2*p2 - 4*p3 - 6*p4 - 8*p5 - 10*p6 - 12*p7 - 14*p8 - 16*p9 - 18*p10 - 20*p11 - 22*p12 - 24*p13 - 26*p14 - 28*p15 - 30*p16 - 32*p17 - 34*p18 - 36*p19 - 38*p20 + 20*p21 + p22 + 2*p23 + 3*p24 + 4*p25 + 5*p26 + 6*p27 + 7*p28 + 8*p29 + 9*p30 + 10*p31 + 11*p32 + 12*p33 + 13*p34 + 14*p35 + 15*p36 + 16*p37 + 17*p38 + 18*p39 + 19*p40 + 20*p61 + p62 + 2*p63 + 3*p64 + 4*p65 + 5*p66 + 6*p67 + 7*p68 + 8*p69 + 9*p70 + 10*p71 + 11*p72 + 12*p73 + 13*p74 + 14*p75 + 15*p76 + 16*p77 + 17*p78 + 18*p79 + 19*p80 + p87 + p91 + p93 + p101 + p102 + p108 + p113 + p115 + p119 - p169 + p171 + p173 + p175 + p177 + p181 - p185 - p190 - p192 = 1
inv : p0 + p114 + p115 = 1
inv : p0 + p174 + p175 + p176 + p177 + p178 + p183 + p184 = 1
inv : p131 - p135 + p147 - p151 - p163 + p167 = 0
inv : -3*p0 - 40*p1 - 2*p2 - 4*p3 - 6*p4 - 8*p5 - 10*p6 - 12*p7 - 14*p8 - 16*p9 - 18*p10 - 20*p11 - 22*p12 - 24*p13 - 26*p14 - 28*p15 - 30*p16 - 32*p17 - 34*p18 - 36*p19 - 38*p20 + 40*p21 + 2*p22 + 4*p23 + 6*p24 + 8*p25 + 10*p26 + 12*p27 + 14*p28 + 16*p29 + 18*p30 + 20*p31 + 22*p32 + 24*p33 + 26*p34 + 28*p35 + 30*p36 + 32*p37 + 34*p38 + 36*p39 + 38*p40 + p113 + p115 + p119 + p175 + p179 + p183 - p185 - p189 - 2*p190 - p192 - p194 = -3
inv : p0 + p154 + p155 + p170 + p171 = 1
inv : p0 + p152 + p153 + p170 + p171 = 1
inv : p0 + p81 + p82 = 1
inv : p98 + p99 - p100 - p101 = 0
inv : p0 + p142 + p143 = 1
inv : p102 + p103 - p104 - p105 = 0
inv : p0 + p136 + p137 = 1
inv : p0 + p92 = 1
inv : p127 - p135 + p143 - p151 - p159 + p167 = 0
inv : p0 + p112 + p113 = 1
inv : p0 + p106 + p107 = 1
inv : p181 + p182 - p183 - p184 = 0
inv : p0 + 20*p1 + p2 + 2*p3 + 3*p4 + 4*p5 + 5*p6 + 6*p7 + 7*p8 + 8*p9 + 9*p10 + 10*p11 + 11*p12 + 12*p13 + 13*p14 + 14*p15 + 15*p16 + 16*p17 + 17*p18 + 18*p19 + 19*p20 - 20*p21 - p22 - 2*p23 - 3*p24 - 4*p25 - 5*p26 - 6*p27 - 7*p28 - 8*p29 - 9*p30 - 10*p31 - 11*p32 - 12*p33 - 13*p34 - 14*p35 - 15*p36 - 16*p37 - 17*p38 - 18*p39 - 19*p40 + p89 - p91 - p115 - p119 - p174 - p175 - p177 - p178 - p183 - p184 + p185 + p190 + p192 = 1
inv : p0 + p83 + p84 = 1
inv : p129 - p135 + p145 - p151 - p161 + p167 = 0
inv : p0 + p150 + p151 = 1
inv : p0 + p158 + p159 + p170 + p171 = 1
inv : -2*p0 - 20*p1 - p2 - 2*p3 - 3*p4 - 4*p5 - 5*p6 - 6*p7 - 7*p8 - 8*p9 - 9*p10 - 10*p11 - 11*p12 - 12*p13 - 13*p14 - 14*p15 - 15*p16 - 16*p17 - 17*p18 - 18*p19 - 19*p20 + 20*p21 + p22 + 2*p23 + 3*p24 + 4*p25 + 5*p26 + 6*p27 + 7*p28 + 8*p29 + 9*p30 + 10*p31 + 11*p32 + 12*p33 + 13*p34 + 14*p35 + 15*p36 + 16*p37 + 17*p38 + 18*p39 + 19*p40 + p113 + p117 + p135 + p151 - p167 - p170 + p173 + p175 + p177 + p181 - p190 - p192 = -2
inv : p0 + p118 + p119 = 1
inv : p0 + p120 + p135 - p137 + p151 + p153 - p167 = 1
Total of 59 invariants.
[2020-05-15 10:27:28] [INFO ] Computed 59 place invariants in 35 ms
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph4626138941344002261.bin, -l, -1, -v, -w, /tmp/graph4626138941344002261.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-15 10:27:28] [INFO ] Decomposing Gal with order
[2020-05-15 10:27:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-15 10:27:28] [INFO ] Removed a total of 14 redundant transitions.
[2020-05-15 10:27:28] [INFO ] Flatten gal took : 124 ms
[2020-05-15 10:27:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 25 ms.
[2020-05-15 10:27:28] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 17 ms
[2020-05-15 10:27:28] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 7 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-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLFireability.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLFireability.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLFireability.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLFireability.ltl -c -stutter-deadlock
Read 15 LTL properties
Checking formula 0 : !((X(X(X(G("((i0.u2.p64==1)&&(i0.u2.p85==1))"))))))
Formula 0 simplified : !XXXG"((i0.u2.p64==1)&&(i0.u2.p85==1))"
built 8 ordering constraints for composite.
built 5 ordering constraints for composite.
built 15 ordering constraints for composite.
built 8 ordering constraints for composite.
built 15 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 28 ordering constraints for composite.
[2020-05-15 10:27:29] [INFO ] Proved 195 variables to be positive in 743 ms
[2020-05-15 10:27:29] [INFO ] Computing symmetric may disable matrix : 138 transitions.
[2020-05-15 10:27:29] [INFO ] Computation of disable matrix completed :0/138 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-15 10:27:29] [INFO ] Computation of Complete disable matrix. took 27 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-15 10:27:29] [INFO ] Computing symmetric may enable matrix : 138 transitions.
[2020-05-15 10:27:29] [INFO ] Computation of Complete enable matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-15 10:27:33] [INFO ] Computing symmetric co enabling matrix : 138 transitions.
[2020-05-15 10:27:33] [INFO ] Computation of co-enabling matrix(0/138) took 219 ms. Total solver calls (SAT/UNSAT): 76(76/0)
[2020-05-15 10:27:36] [INFO ] Computation of co-enabling matrix(15/138) took 3312 ms. Total solver calls (SAT/UNSAT): 963(738/225)
[2020-05-15 10:27:39] [INFO ] Computation of co-enabling matrix(23/138) took 6512 ms. Total solver calls (SAT/UNSAT): 1535(1294/241)
Reverse transition relation is NOT exact ! Due to transitions t1, t107, t108, t141, u12.t90, u13.t11, u47.t5, u47.t31, i0.u2.t8, i0.u2.t51, i0.u2.t55, i0.u2.t56, i0.u2.t57, i0.u2.t58, i0.u2.t59, i0.u2.t60, i0.u2.t61, i0.u2.t62, i0.u2.t63, i0.u2.t64, i0.u2.t65, i0.u2.t66, i0.u2.t67, i0.u2.t68, i0.u2.t69, i0.u2.t70, i1.i0.u0.t10, i1.i0.u6.t150, i1.i1.t0, i1.i1.t139, i1.i1.t149, i1.i1.u1.t9, i12.t116, i12.t4, i12.t3, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/100/35/135
[2020-05-15 10:27:42] [INFO ] Computation of co-enabling matrix(32/138) took 9513 ms. Total solver calls (SAT/UNSAT): 2102(1843/259)
Computing Next relation with stutter on 932208 deadlock states
[2020-05-15 10:27:45] [INFO ] Computation of co-enabling matrix(42/138) took 12716 ms. Total solver calls (SAT/UNSAT): 2637(2358/279)
[2020-05-15 10:27:48] [INFO ] Computation of co-enabling matrix(57/138) took 15754 ms. Total solver calls (SAT/UNSAT): 3189(2880/309)
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 items max in DFS search stack
2247 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,22.5312,362472,1,0,839003,35600,1982,941679,2416,177092,1087004
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA DES-PT-20a-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((((G(X(((G(!(X("((i9.u29.p146==1)&&(i9.u37.p162==1))"))))&&("(i5.u18.p124==1)"))&&("(i5.u26.p141==1)"))))U("((i9.u29.p146==1)&&(i9.u37.p162==1))"))||(F("((u47.p21==1)&&(u47.p190==1))"))))
Formula 1 simplified : !((GX("(i5.u18.p124==1)" & "(i5.u26.p141==1)" & G!X"((i9.u29.p146==1)&&(i9.u37.p162==1))") U "((i9.u29.p146==1)&&(i9.u37.p162==1))") | F"((u47.p21==1)&&(u47.p190==1))")
Computing Next relation with stutter on 932208 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,22.5375,363936,1,0,839003,35600,2042,941679,2418,177092,1087030
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA DES-PT-20a-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !(((G(X("((i12.u4.p91==1)&&(i12.u46.p185==1))")))U(G(("((i0.u2.p69==1)&&(i0.u2.p85==1))")U((!(G(F("((i1.i1.u5.p93==1)&&(i1.i1.u8.p100==1))"))))&&("(((i12.u4.p91==1)&&(i12.u46.p185==1))||((i7.u19.p126==1)&&(i7.u27.p143==1)))"))))))
Formula 2 simplified : !(GX"((i12.u4.p91==1)&&(i12.u46.p185==1))" U G("((i0.u2.p69==1)&&(i0.u2.p85==1))" U ("(((i12.u4.p91==1)&&(i12.u46.p185==1))||((i7.u19.p126==1)&&(i7.u27.p143==1)))" & !GF"((i1.i1.u5.p93==1)&&(i1.i1.u8.p100==1))")))
Computing Next relation with stutter on 932208 deadlock states
[2020-05-15 10:27:51] [INFO ] Computation of co-enabling matrix(108/138) took 18779 ms. Total solver calls (SAT/UNSAT): 3791(3359/432)
[2020-05-15 10:27:52] [INFO ] Computation of Finished co-enabling matrix. took 19652 ms. Total solver calls (SAT/UNSAT): 3836(3385/451)
[2020-05-15 10:27:52] [INFO ] Computing Do-Not-Accords matrix : 138 transitions.
[2020-05-15 10:27:53] [WARNING] SMT solver unexpectedly returned 'unknown' answer, retrying.
[2020-05-15 10:27:54] [INFO ] Computation of Completed DNA matrix. took 1696 ms. Total solver calls (SAT/UNSAT): 26(0/26)
[2020-05-15 10:27:54] [INFO ] Built C files in 26504ms conformant to PINS in folder :/home/mcc/execution
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/home/mcc/execution]
Compilation finished in 4192 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 59 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, ([](X((LTLAP5==true))))U([](((LTLAP6==true))U(( !( [](<>((LTLAP7==true)))) ) && ( (LTLAP8==true) )))), --buchi-type=spotba], workingDir=/home/mcc/execution]
/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc: error while loading shared libraries: libltdl.so.7: cannot open shared object file: No such file or directory
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, ([](X((LTLAP5==true))))U([](((LTLAP6==true))U(( !( [](<>((LTLAP7==true)))) ) && ( (LTLAP8==true) )))), --buchi-type=spotba], workingDir=/home/mcc/execution]
127
java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, ([](X((LTLAP5==true))))U([](((LTLAP6==true))U(( !( [](<>((LTLAP7==true)))) ) && ( (LTLAP8==true) )))), --buchi-type=spotba], workingDir=/home/mcc/execution]
127
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:170)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:124)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:834)
56 unique states visited
56 strongly connected components in search stack
56 transitions explored
56 items max in DFS search stack
1330 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,35.8459,527484,1,0,1.15224e+06,36848,2123,1.3841e+06,2423,185380,1489715
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA DES-PT-20a-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((G(((!(("((i5.u26.p140==1)&&(i5.u34.p156==1))")U("((i12.u43.p182==1)&&(i12.u45.p184==1))")))||(!(X("((i5.u26.p140!=1)||(i5.u34.p156!=1))"))))U(("((i5.u26.p140!=1)||(i5.u34.p156!=1))")U(X("((i5.u18.p124==1)&&(i5.u26.p141==1))"))))))
Formula 3 simplified : !G((!("((i5.u26.p140==1)&&(i5.u34.p156==1))" U "((i12.u43.p182==1)&&(i12.u45.p184==1))") | !X"((i5.u26.p140!=1)||(i5.u34.p156!=1))") U ("((i5.u26.p140!=1)||(i5.u34.p156!=1))" U X"((i5.u18.p124==1)&&(i5.u26.p141==1))"))
Computing Next relation with stutter on 932208 deadlock states
63 unique states visited
62 strongly connected components in search stack
64 transitions explored
62 items max in DFS search stack
651 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,42.3537,610628,1,0,1.35312e+06,36975,2195,1.53793e+06,2424,186114,1762612
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA DES-PT-20a-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((X(X(G((F(G(X((F("((i0.u2.p78==1)&&(i0.u2.p85==1))"))||("((u47.p34==1)&&(u47.p190==1))")))))||("((u47.p34==1)&&(u47.p190==1))"))))))
Formula 4 simplified : !XXG("((u47.p34==1)&&(u47.p190==1))" | FGX("((u47.p34==1)&&(u47.p190==1))" | F"((i0.u2.p78==1)&&(i0.u2.p85==1))"))
Computing Next relation with stutter on 932208 deadlock states
147 unique states visited
147 strongly connected components in search stack
148 transitions explored
147 items max in DFS search stack
11225 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,154.609,1849628,1,0,3.67784e+06,37480,2267,6.94809e+06,2434,196554,3806007
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA DES-PT-20a-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((!(G(!(F(X((G("(i1.i1.u1.p84==1)"))&&(G("((i12.u42.p172==1)&&(i12.u43.p181==1))")))))))))
Formula 5 simplified : G!FX(G"(i1.i1.u1.p84==1)" & G"((i12.u42.p172==1)&&(i12.u43.p181==1))")
Computing Next relation with stutter on 932208 deadlock states
59 unique states visited
59 strongly connected components in search stack
59 transitions explored
59 items max in DFS search stack
81076 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,965.366,10081836,1,0,1.71268e+07,41300,2345,2.19344e+07,2435,242169,16341331
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA DES-PT-20a-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !(((!(F("(((((((((i12.u14.p116==1)&&(i4.u16.p121==1))&&(i6.u17.p123==1))&&(i5.u18.p125==1))&&(i7.u19.p127==1))&&(i8.u20.p129==1))&&(i9.u21.p131==1))&&(i10.u22.p133==1))&&(i11.u23.p135==1))")))||(!(X((X(!(F("((i0.u2.p68==1)&&(i0.u2.p85==1))"))))||("((u12.p48==1)&&(u12.p110==1))"))))))
Formula 6 simplified : !(!F"(((((((((i12.u14.p116==1)&&(i4.u16.p121==1))&&(i6.u17.p123==1))&&(i5.u18.p125==1))&&(i7.u19.p127==1))&&(i8.u20.p129==1))&&(i9.u21.p131==1))&&(i10.u22.p133==1))&&(i11.u23.p135==1))" | !X("((u12.p48==1)&&(u12.p110==1))" | X!F"((i0.u2.p68==1)&&(i0.u2.p85==1))"))
Computing Next relation with stutter on 932208 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
11135 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1076.71,10505016,1,0,1.80084e+07,41424,813,2.2741e+07,776,243223,133220
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA DES-PT-20a-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !(((X(G(!((G("((i12.u45.p183==1)&&(i12.u46.p189==1))"))U("((u47.p34==1)&&(u47.p190==1))")))))&&(!(G(((F("((u12.p59==1)&&(u12.p110==1))"))&&("(u47.p34==1)"))&&("(u47.p190==1)"))))))
Formula 7 simplified : !(XG!(G"((i12.u45.p183==1)&&(i12.u46.p189==1))" U "((u47.p34==1)&&(u47.p190==1))") & !G("(u47.p34==1)" & "(u47.p190==1)" & F"((u12.p59==1)&&(u12.p110==1))"))
Computing Next relation with stutter on 932208 deadlock states
61 unique states visited
61 strongly connected components in search stack
62 transitions explored
61 items max in DFS search stack
1466 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1091.4,10505016,1,0,1.80084e+07,41424,1019,2.2741e+07,1018,243223,801404
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA DES-PT-20a-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !(((G(X(G("(((u13.p3==1)&&(u13.p113==1))&&(u13.p115==1))"))))||(!(F("(((u13.p6==1)&&(u13.p113==1))&&(u13.p115==1))")))))
Formula 8 simplified : !(GXG"(((u13.p3==1)&&(u13.p113==1))&&(u13.p115==1))" | !F"(((u13.p6==1)&&(u13.p113==1))&&(u13.p115==1))")
Computing Next relation with stutter on 932208 deadlock states
61 unique states visited
61 strongly connected components in search stack
62 transitions explored
61 items max in DFS search stack
367 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1095.07,10505016,1,0,1.80084e+07,41424,1086,2.2741e+07,1047,243223,933068
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA DES-PT-20a-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !(((F((F(X("((i4.u16.p120==1)&&(i4.u24.p137==1))")))&&(F("(((u13.p11==1)&&(u13.p113==1))&&(u13.p115==1))"))))U(F((X(X(F("(((u13.p13==1)&&(u13.p113==1))&&(u13.p115==1))"))))||("(((u13.p11==1)&&(u13.p113==1))&&(u13.p115==1))")))))
Formula 9 simplified : !(F(FX"((i4.u16.p120==1)&&(i4.u24.p137==1))" & F"(((u13.p11==1)&&(u13.p113==1))&&(u13.p115==1))") U F("(((u13.p11==1)&&(u13.p113==1))&&(u13.p115==1))" | XXF"(((u13.p13==1)&&(u13.p113==1))&&(u13.p115==1))"))
Computing Next relation with stutter on 932208 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
9 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1095.15,10505016,1,0,1.80084e+07,41424,1126,2.2741e+07,1062,243223,934562
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA DES-PT-20a-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((F(X(((X(X("((i1.i1.u7.p103==1)&&(i1.i1.u9.p105==1))")))&&("(u12.p56==1)"))&&("(u12.p110==1)")))))
Formula 10 simplified : !FX("(u12.p56==1)" & "(u12.p110==1)" & XX"((i1.i1.u7.p103==1)&&(i1.i1.u9.p105==1))")
Computing Next relation with stutter on 932208 deadlock states
Detected timeout of ITS tools.
[2020-05-15 10:47:42] [INFO ] Applying decomposition
[2020-05-15 10:47:42] [INFO ] Flatten gal took : 53 ms
[2020-05-15 10:47:42] [INFO ] Decomposing Gal with order
[2020-05-15 10:47:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-15 10:47:42] [INFO ] Removed a total of 153 redundant transitions.
[2020-05-15 10:47:42] [INFO ] Flatten gal took : 64 ms
[2020-05-15 10:47:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 88 labels/synchronizations in 11 ms.
[2020-05-15 10:47:42] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 12 ms
[2020-05-15 10:47:42] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 2 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-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLFireability.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLFireability.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLFireability.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLFireability.ltl -c -stutter-deadlock
Read 5 LTL properties
Checking formula 0 : !((F(X(((X(X("((u15.p103==1)&&(u16.p105==1))")))&&("(u3.p56==1)"))&&("(u19.p110==1)")))))
Formula 0 simplified : !FX("(u3.p56==1)" & "(u19.p110==1)" & XX"((u15.p103==1)&&(u16.p105==1))")
built 47 ordering constraints for composite.
built 15 ordering constraints for composite.
built 7 ordering constraints for composite.
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t30, t50, t70, t77, t107, t108, t119, t139, t141, t149, u5.t10, u6.t9, u7.t8, u12.t150, i50.t4, i50.t3, i52.t5, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/38/19/57
Computing Next relation with stutter on 932208 deadlock states
Detected timeout of ITS tools.
[2020-05-15 11:07:56] [INFO ] Flatten gal took : 27 ms
[2020-05-15 11:07:56] [INFO ] Input system was already deterministic with 138 transitions.
[2020-05-15 11:07:56] [INFO ] Transformed 195 places.
[2020-05-15 11:07:56] [INFO ] Transformed 138 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2020-05-15 11:07:56] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 3 ms
[2020-05-15 11:07:56] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 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-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLFireability.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLFireability.ltl, -c, -stutter-deadlock, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLFireability.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLFireability.ltl -c -stutter-deadlock --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Read 5 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(X(((X(X("((p103==1)&&(p105==1))")))&&("(p56==1)"))&&("(p110==1)")))))
Formula 0 simplified : !FX("(p56==1)" & "(p110==1)" & XX"((p103==1)&&(p105==1))")
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -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="DES-PT-20a"
export BK_EXAMINATION="LTLFireability"
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 DES-PT-20a, 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 r051-ebro-158902545900258"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-20a.tgz
mv DES-PT-20a 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 '
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 ;