About the Execution of ITS-LoLa for DoubleExponent-PT-002
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15739.940 | 3600000.00 | 18940.00 | 48.30 | FTTTTTFFTTTFFFTT | 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.r178-tajo-158987882800754.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 DoubleExponent-PT-002, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-tajo-158987882800754
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 212K
-rw-r--r-- 1 mcc users 3.4K Mar 31 07:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 31 07:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 30 00:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 30 00:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.8K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.8K Apr 8 14:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 8 14:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 28 14:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 28 14:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Mar 27 07:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K Mar 27 07:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 28 14:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 28 14:50 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 33K 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 DoubleExponent-PT-002-00
FORMULA_NAME DoubleExponent-PT-002-01
FORMULA_NAME DoubleExponent-PT-002-02
FORMULA_NAME DoubleExponent-PT-002-03
FORMULA_NAME DoubleExponent-PT-002-04
FORMULA_NAME DoubleExponent-PT-002-05
FORMULA_NAME DoubleExponent-PT-002-06
FORMULA_NAME DoubleExponent-PT-002-07
FORMULA_NAME DoubleExponent-PT-002-08
FORMULA_NAME DoubleExponent-PT-002-09
FORMULA_NAME DoubleExponent-PT-002-10
FORMULA_NAME DoubleExponent-PT-002-11
FORMULA_NAME DoubleExponent-PT-002-12
FORMULA_NAME DoubleExponent-PT-002-13
FORMULA_NAME DoubleExponent-PT-002-14
FORMULA_NAME DoubleExponent-PT-002-15
=== Now, execution of the tool begins
BK_START 1591239066777
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 02:51:08] [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-04 02:51:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 02:51:08] [INFO ] Load time of PNML (sax parser for PT used): 34 ms
[2020-06-04 02:51:08] [INFO ] Transformed 110 places.
[2020-06-04 02:51:08] [INFO ] Transformed 98 transitions.
[2020-06-04 02:51:08] [INFO ] Parsed PT model containing 110 places and 98 transitions in 69 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 3295 resets, run finished after 149 ms. (steps per millisecond=671 ) properties seen :[1, 1, 1, 1, 1, 0, 0, 0, 1, 0, 1, 1, 1, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0]
// Phase 1: matrix 98 rows 110 cols
[2020-06-04 02:51:08] [INFO ] Computed 14 place invariants in 7 ms
[2020-06-04 02:51:08] [INFO ] [Real]Absence check using 5 positive place invariants in 19 ms returned sat
[2020-06-04 02:51:08] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 4 ms returned sat
[2020-06-04 02:51:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:51:08] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2020-06-04 02:51:08] [INFO ] Deduced a trap composed of 18 places in 106 ms
[2020-06-04 02:51:08] [INFO ] Deduced a trap composed of 30 places in 44 ms
[2020-06-04 02:51:08] [INFO ] Deduced a trap composed of 36 places in 40 ms
[2020-06-04 02:51:09] [INFO ] Deduced a trap composed of 53 places in 26 ms
[2020-06-04 02:51:09] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 256 ms
[2020-06-04 02:51:09] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:51:09] [INFO ] [Nat]Absence check using 5 positive place invariants in 15 ms returned sat
[2020-06-04 02:51:09] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 5 ms returned sat
[2020-06-04 02:51:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:51:09] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2020-06-04 02:51:09] [INFO ] Deduced a trap composed of 18 places in 45 ms
[2020-06-04 02:51:09] [INFO ] Deduced a trap composed of 30 places in 47 ms
[2020-06-04 02:51:09] [INFO ] Deduced a trap composed of 36 places in 26 ms
[2020-06-04 02:51:09] [INFO ] Deduced a trap composed of 53 places in 27 ms
[2020-06-04 02:51:09] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 186 ms
[2020-06-04 02:51:09] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints in 8 ms.
[2020-06-04 02:51:09] [INFO ] Added : 95 causal constraints over 19 iterations in 146 ms. Result :sat
[2020-06-04 02:51:09] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2020-06-04 02:51:09] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 3 ms returned sat
[2020-06-04 02:51:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:51:09] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2020-06-04 02:51:09] [INFO ] Deduced a trap composed of 46 places in 37 ms
[2020-06-04 02:51:09] [INFO ] Deduced a trap composed of 58 places in 31 ms
[2020-06-04 02:51:09] [INFO ] Deduced a trap composed of 44 places in 27 ms
[2020-06-04 02:51:09] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 115 ms
[2020-06-04 02:51:09] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:51:09] [INFO ] [Nat]Absence check using 5 positive place invariants in 12 ms returned sat
[2020-06-04 02:51:09] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 3 ms returned sat
[2020-06-04 02:51:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:51:09] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2020-06-04 02:51:09] [INFO ] Deduced a trap composed of 55 places in 34 ms
[2020-06-04 02:51:09] [INFO ] Deduced a trap composed of 47 places in 26 ms
[2020-06-04 02:51:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 73 ms
[2020-06-04 02:51:09] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints in 8 ms.
[2020-06-04 02:51:09] [INFO ] Added : 95 causal constraints over 19 iterations in 156 ms. Result :sat
[2020-06-04 02:51:10] [INFO ] [Real]Absence check using 5 positive place invariants in 11 ms returned sat
[2020-06-04 02:51:10] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 7 ms returned sat
[2020-06-04 02:51:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:51:10] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2020-06-04 02:51:10] [INFO ] Deduced a trap composed of 30 places in 29 ms
[2020-06-04 02:51:10] [INFO ] Deduced a trap composed of 18 places in 22 ms
[2020-06-04 02:51:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 64 ms
[2020-06-04 02:51:10] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:51:10] [INFO ] [Nat]Absence check using 5 positive place invariants in 11 ms returned sat
[2020-06-04 02:51:10] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 3 ms returned sat
[2020-06-04 02:51:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:51:10] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2020-06-04 02:51:10] [INFO ] Deduced a trap composed of 30 places in 40 ms
[2020-06-04 02:51:10] [INFO ] Deduced a trap composed of 18 places in 33 ms
[2020-06-04 02:51:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 92 ms
[2020-06-04 02:51:10] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints in 7 ms.
[2020-06-04 02:51:10] [INFO ] Added : 93 causal constraints over 19 iterations in 181 ms. Result :sat
[2020-06-04 02:51:10] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2020-06-04 02:51:10] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 4 ms returned sat
[2020-06-04 02:51:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:51:10] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2020-06-04 02:51:10] [INFO ] Deduced a trap composed of 18 places in 27 ms
[2020-06-04 02:51:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
[2020-06-04 02:51:10] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:51:10] [INFO ] [Nat]Absence check using 5 positive place invariants in 12 ms returned sat
[2020-06-04 02:51:10] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 3 ms returned sat
[2020-06-04 02:51:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:51:10] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2020-06-04 02:51:10] [INFO ] Deduced a trap composed of 30 places in 46 ms
[2020-06-04 02:51:10] [INFO ] Deduced a trap composed of 18 places in 32 ms
[2020-06-04 02:51:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 96 ms
[2020-06-04 02:51:10] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints in 6 ms.
[2020-06-04 02:51:10] [INFO ] Added : 93 causal constraints over 19 iterations in 183 ms. Result :sat
[2020-06-04 02:51:11] [INFO ] [Real]Absence check using 5 positive place invariants in 7 ms returned unsat
[2020-06-04 02:51:11] [INFO ] [Real]Absence check using 5 positive place invariants in 12 ms returned unsat
[2020-06-04 02:51:11] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2020-06-04 02:51:11] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 4 ms returned sat
[2020-06-04 02:51:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:51:11] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2020-06-04 02:51:11] [INFO ] Deduced a trap composed of 18 places in 36 ms
[2020-06-04 02:51:11] [INFO ] Deduced a trap composed of 30 places in 35 ms
[2020-06-04 02:51:11] [INFO ] Deduced a trap composed of 45 places in 27 ms
[2020-06-04 02:51:11] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 119 ms
[2020-06-04 02:51:11] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:51:11] [INFO ] [Nat]Absence check using 5 positive place invariants in 23 ms returned sat
[2020-06-04 02:51:11] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 6 ms returned sat
[2020-06-04 02:51:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:51:11] [INFO ] [Nat]Absence check using state equation in 76 ms returned sat
[2020-06-04 02:51:11] [INFO ] Deduced a trap composed of 18 places in 29 ms
[2020-06-04 02:51:11] [INFO ] Deduced a trap composed of 45 places in 46 ms
[2020-06-04 02:51:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 93 ms
[2020-06-04 02:51:11] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints in 6 ms.
[2020-06-04 02:51:11] [INFO ] Added : 81 causal constraints over 17 iterations in 165 ms. Result :sat
[2020-06-04 02:51:11] [INFO ] [Real]Absence check using 5 positive place invariants in 7 ms returned sat
[2020-06-04 02:51:11] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 5 ms returned sat
[2020-06-04 02:51:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:51:11] [INFO ] [Real]Absence check using state equation in 74 ms returned sat
[2020-06-04 02:51:11] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints in 7 ms.
[2020-06-04 02:51:11] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:51:11] [INFO ] [Nat]Absence check using 5 positive place invariants in 24 ms returned sat
[2020-06-04 02:51:11] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 8 ms returned sat
[2020-06-04 02:51:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:51:11] [INFO ] [Nat]Absence check using state equation in 90 ms returned sat
[2020-06-04 02:51:11] [INFO ] Deduced a trap composed of 38 places in 32 ms
[2020-06-04 02:51:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2020-06-04 02:51:12] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints in 6 ms.
[2020-06-04 02:51:12] [INFO ] Added : 87 causal constraints over 18 iterations in 158 ms. Result :sat
[2020-06-04 02:51:12] [INFO ] Deduced a trap composed of 18 places in 29 ms
[2020-06-04 02:51:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 46 ms
[2020-06-04 02:51:12] [INFO ] [Real]Absence check using 5 positive place invariants in 6 ms returned sat
[2020-06-04 02:51:12] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 4 ms returned sat
[2020-06-04 02:51:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:51:12] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2020-06-04 02:51:12] [INFO ] Deduced a trap composed of 30 places in 23 ms
[2020-06-04 02:51:12] [INFO ] Deduced a trap composed of 18 places in 28 ms
[2020-06-04 02:51:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 62 ms
[2020-06-04 02:51:12] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:51:12] [INFO ] [Nat]Absence check using 5 positive place invariants in 15 ms returned sat
[2020-06-04 02:51:12] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 4 ms returned sat
[2020-06-04 02:51:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:51:12] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2020-06-04 02:51:12] [INFO ] Deduced a trap composed of 30 places in 25 ms
[2020-06-04 02:51:12] [INFO ] Deduced a trap composed of 18 places in 24 ms
[2020-06-04 02:51:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 61 ms
[2020-06-04 02:51:12] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints in 5 ms.
[2020-06-04 02:51:12] [INFO ] Added : 93 causal constraints over 19 iterations in 146 ms. Result :sat
[2020-06-04 02:51:12] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2020-06-04 02:51:12] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 3 ms returned sat
[2020-06-04 02:51:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:51:12] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2020-06-04 02:51:12] [INFO ] Deduced a trap composed of 18 places in 38 ms
[2020-06-04 02:51:12] [INFO ] Deduced a trap composed of 45 places in 33 ms
[2020-06-04 02:51:12] [INFO ] Deduced a trap composed of 70 places in 33 ms
[2020-06-04 02:51:12] [INFO ] Deduced a trap composed of 44 places in 33 ms
[2020-06-04 02:51:12] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 165 ms
[2020-06-04 02:51:12] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:51:12] [INFO ] [Nat]Absence check using 5 positive place invariants in 15 ms returned sat
[2020-06-04 02:51:12] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 5 ms returned sat
[2020-06-04 02:51:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:51:13] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2020-06-04 02:51:13] [INFO ] Deduced a trap composed of 18 places in 38 ms
[2020-06-04 02:51:13] [INFO ] Deduced a trap composed of 33 places in 31 ms
[2020-06-04 02:51:13] [INFO ] Deduced a trap composed of 45 places in 30 ms
[2020-06-04 02:51:13] [INFO ] Deduced a trap composed of 70 places in 28 ms
[2020-06-04 02:51:13] [INFO ] Deduced a trap composed of 44 places in 27 ms
[2020-06-04 02:51:13] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 185 ms
[2020-06-04 02:51:13] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints in 6 ms.
[2020-06-04 02:51:13] [INFO ] Added : 95 causal constraints over 19 iterations in 122 ms. Result :sat
[2020-06-04 02:51:13] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2020-06-04 02:51:13] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 3 ms returned sat
[2020-06-04 02:51:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:51:13] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2020-06-04 02:51:13] [INFO ] Deduced a trap composed of 18 places in 28 ms
[2020-06-04 02:51:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
[2020-06-04 02:51:13] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:51:13] [INFO ] [Nat]Absence check using 5 positive place invariants in 13 ms returned sat
[2020-06-04 02:51:13] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 4 ms returned sat
[2020-06-04 02:51:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:51:13] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2020-06-04 02:51:13] [INFO ] Deduced a trap composed of 18 places in 39 ms
[2020-06-04 02:51:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
[2020-06-04 02:51:13] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints in 5 ms.
[2020-06-04 02:51:13] [INFO ] Added : 95 causal constraints over 19 iterations in 158 ms. Result :sat
[2020-06-04 02:51:13] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2020-06-04 02:51:13] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 4 ms returned sat
[2020-06-04 02:51:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:51:13] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2020-06-04 02:51:13] [INFO ] Deduced a trap composed of 18 places in 20 ms
[2020-06-04 02:51:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 27 ms
[2020-06-04 02:51:13] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:51:13] [INFO ] [Nat]Absence check using 5 positive place invariants in 10 ms returned sat
[2020-06-04 02:51:13] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 4 ms returned sat
[2020-06-04 02:51:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:51:13] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2020-06-04 02:51:13] [INFO ] Deduced a trap composed of 18 places in 32 ms
[2020-06-04 02:51:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 38 ms
[2020-06-04 02:51:13] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints in 5 ms.
[2020-06-04 02:51:14] [INFO ] Added : 94 causal constraints over 19 iterations in 123 ms. Result :sat
[2020-06-04 02:51:14] [INFO ] Deduced a trap composed of 46 places in 34 ms
[2020-06-04 02:51:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 46 ms
Successfully simplified 2 atomic propositions for a total of 2 simplifications.
[2020-06-04 02:51:14] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2020-06-04 02:51:14] [INFO ] Flatten gal took : 33 ms
FORMULA DoubleExponent-PT-002-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-002-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-002-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-002-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-04 02:51:14] [INFO ] Flatten gal took : 10 ms
[2020-06-04 02:51:14] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2020-06-04 02:51:14] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ DoubleExponent-PT-002 @ 3570 seconds
FORMULA DoubleExponent-PT-002-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DoubleExponent-PT-002-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DoubleExponent-PT-002-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DoubleExponent-PT-002-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DoubleExponent-PT-002-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DoubleExponent-PT-002-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DoubleExponent-PT-002-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DoubleExponent-PT-002-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DoubleExponent-PT-002-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DoubleExponent-PT-002-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DoubleExponent-PT-002-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DoubleExponent-PT-002-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3567
rslt: Output for LTLFireability @ DoubleExponent-PT-002
{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=LTLFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Thu Jun 4 02:51:14 2020
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X ((X (F ((1 <= p22))) OR G ((p43 <= 0))))",
"processed_size": 42,
"rewrites": 119
},
"result":
{
"edges": 70,
"markings": 67,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "((1 <= p65) AND (1 <= p86))",
"processed_size": 27,
"rewrites": 119
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(1 <= p43)",
"processed_size": 10,
"rewrites": 119
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 2,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(p43 <= 0)",
"processed_size": 10,
"rewrites": 121
},
"result":
{
"edges": 22,
"markings": 23,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 3
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (F (((p65 <= 0) OR (p86 <= 0))))",
"processed_size": 35,
"rewrites": 119
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 3,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 0,
"aneg": 4,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 0,
"tdisj": 3,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "G (((G (((1 <= p16) AND (1 <= p88))) R (G ((p95 <= 0)) OR X (F (((p40 <= 0) OR (p60 <= 0)))))) OR ((p40 <= 0) OR (p60 <= 0))))",
"processed_size": 127,
"rewrites": 119
},
"result":
{
"edges": 49121,
"markings": 25695,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 12
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "X (F ((1 <= p24)))",
"processed_size": 18,
"rewrites": 119
},
"result":
{
"edges": 14,
"markings": 15,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 4,
"aconj": 3,
"adisj": 2,
"aneg": 1,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "X ((X (X (X ((((p9 <= 0) OR (p92 <= 0)) AND (p82 <= 0))))) R (((p9 <= 0) OR (p92 <= 0)) AND ((p1 <= 0) OR (p109 <= 0)))))",
"processed_size": 124,
"rewrites": 119
},
"result":
{
"edges": 4,
"markings": 5,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 9
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(1 <= p59)",
"processed_size": 10,
"rewrites": 119
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 5,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "X (F ((p52 <= 0)))",
"processed_size": 18,
"rewrites": 119
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 5,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 2,
"aconj": 1,
"adisj": 1,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X ((X (F (((p12 <= 0) OR (p35 <= 0)))) AND ((p12 <= 0) OR (p35 <= 0))))",
"processed_size": 73,
"rewrites": 119
},
"result":
{
"edges": 3,
"markings": 4,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (G (((1 <= p104) OR (1 <= p19))))",
"processed_size": 36,
"rewrites": 119
},
"result":
{
"edges": 25,
"markings": 25,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 4,
"G": 4,
"U": 0,
"X": 1,
"aconj": 5,
"adisj": 0,
"aneg": 3,
"comp": 10,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 2,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "G ((X (F (((1 <= p15) AND (1 <= p51)))) AND (F ((((p15 <= 0) OR (p51 <= 0)) AND (F (G (((p27 <= 0) OR (p54 <= 0)))) OR G (((p15 <= 0) OR (p51 <= 0)))))) OR G (F (((1 <= p15) AND (1 <= p51)))))))",
"processed_size": 197,
"rewrites": 119
},
"result":
{
"edges": 25,
"markings": 25,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 12
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1189
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 2,
"aconj": 1,
"adisj": 0,
"aneg": 2,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (X ((G ((p19 <= 0)) OR F (((p9 <= 0) OR (p105 <= 0))))))",
"processed_size": 59,
"rewrites": 119
},
"result":
{
"edges": 2,
"markings": 3,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1783
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 0,
"aneg": 3,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 1,
"tdisj": 3,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "F (G ((F ((G (((p6 <= 0) OR (p41 <= 0))) OR ((p20 <= 0) AND ((p6 <= 0) OR (p41 <= 0))))) OR ((p79 <= 0) OR (p98 <= 0)))))",
"processed_size": 123,
"rewrites": 119
},
"result":
{
"edges": 4103,
"markings": 3708,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3567
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 3,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 4,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "F (G ((G ((G (((p76 <= 0) OR (p85 <= 0))) OR ((p63 <= 0) OR (p90 <= 0)))) AND (1 <= p81))))",
"processed_size": 92,
"rewrites": 119
},
"result":
{
"edges": 28,
"markings": 26,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 26032,
"runtime": 3.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X((X(F(**)) OR G(*))) : (X(F(*)) OR (** OR ((G(*) AND F(**)) OR **))) : F(G((F((G(*) OR (* AND *))) OR (** OR **)))) : G(((G(**) R (G(*) OR X(F(*)))) OR (* OR *))) : X(F(**)) : F(G((G((G(*) OR (* OR *))) AND *))) : X((X(X(X(**))) R *)) : (X(F(**)) OR **) : X((X(F(*)) AND **)) : X(G(**)) : G((X(F(**)) AND (F((* AND (F(G(*)) OR G(*)))) OR G(F(**))))) : X(X((G(*) OR F(*))))"
},
"net":
{
"arcs": 276,
"conflict_clusters": 75,
"places": 110,
"places_significant": 96,
"singleton_clusters": 0,
"transitions": 98
},
"result":
{
"preliminary_value": "no yes yes yes yes no yes yes yes no no yes ",
"value": "no yes yes yes yes no yes yes yes no no yes "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 208/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 3520
lola: finding significant places
lola: 110 places, 98 transitions, 96 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from LTLFireability.xml
lola: NOT(X ((X (NOT(F ((1 <= p22)))) AND F ((1 <= p43))))) : ((F (NOT(X (((1 <= p65) AND (1 <= p86))))) OR (NOT(F ((1 <= p87))) U (1 <= p43))) OR ((1 <= p65) AND (1 <= p86))) : F (G (((NOT(G (((1 <= p20) U ((1 <= p6) AND (1 <= p41))))) OR (p79 <= 0)) OR (p98 <= 0)))) : NOT(F ((((NOT(G (((1 <= p16) AND (1 <= p88)))) U (F ((1 <= p95)) AND X (G (((1 <= p40) AND (1 <= p60)))))) AND (1 <= p40)) AND (1 <= p60)))) : NOT(G (((1 <= 0) U NOT(F (X ((1 <= p24))))))) : NOT(F (G (F ((F (((F (((1 <= p76) AND (1 <= p85))) AND (1 <= p63)) AND (1 <= p90))) OR (p81 <= 0)))))) : NOT(X ((NOT(X (X (X ((((p9 <= 0) OR (p92 <= 0)) AND (p82 <= 0)))))) U (((1 <= p9) AND (1 <= p92)) OR ((1 <= p1) AND (1 <= p109)))))) : (X (F ((G (X (((1 <= p61) AND (1 <= p96)))) U (p52 <= 0)))) OR (1 <= p59)) : X ((X (NOT(G (((1 <= p12) AND (1 <= p35))))) AND ((p12 <= 0) OR (p35 <= 0)))) : G (X (((1 <= p104) OR (1 <= p19)))) : NOT(F ((G ((G (F (((1 <= p27) AND (1 <= p54)))) U ((1 <= p15) AND (1 <= p51)))) U NOT(F (X (((1 <= p15) AND (1 <= p51)))))))) : NOT(X ((F (X ((1 <= p19))) AND X (G (((1 <= p9) AND (1 <= p105)))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X (F ((1 <= p22))) OR G ((p43 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (F ((1 <= p22))) OR G ((p43 <= 0))))
lola: processed formula length: 42
lola: 119 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 67 markings, 70 edges
lola: ========================================
lola: subprocess 1 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (F (((p65 <= 0) OR (p86 <= 0)))) OR ((1 <= p43) OR ((G ((p87 <= 0)) AND F ((1 <= p43))) OR ((1 <= p65) AND (1 <= p86)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p65) AND (1 <= p86))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p65) AND (1 <= p86))
lola: processed formula length: 27
lola: 119 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p43)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p43)
lola: processed formula length: 10
lola: 119 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((1 <= p43))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p43 <= 0)
lola: processed formula length: 10
lola: 121 rewrites
lola: closed formula file LTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 23 markings, 22 edges
lola: ========================================
lola: subprocess 4 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F (((p65 <= 0) OR (p86 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F (((p65 <= 0) OR (p86 <= 0))))
lola: processed formula length: 35
lola: 119 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2 markings, 1 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 2 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((G (((1 <= p16) AND (1 <= p88))) R (G ((p95 <= 0)) OR X (F (((p40 <= 0) OR (p60 <= 0)))))) OR ((p40 <= 0) OR (p60 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((G (((1 <= p16) AND (1 <= p88))) R (G ((p95 <= 0)) OR X (F (((p40 <= 0) OR (p60 <= 0)))))) OR ((p40 <= 0) OR (p60 <= 0))))
lola: processed formula length: 127
lola: 119 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 12 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 25695 markings, 49121 edges
lola: ========================================
lola: subprocess 3 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((1 <= p24)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((1 <= p24)))
lola: processed formula length: 18
lola: 119 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 15 markings, 14 edges
lola: ========================================
lola: subprocess 4 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X (X (X ((((p9 <= 0) OR (p92 <= 0)) AND (p82 <= 0))))) R (((p9 <= 0) OR (p92 <= 0)) AND ((p1 <= 0) OR (p109 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (X (X ((((p9 <= 0) OR (p92 <= 0)) AND (p82 <= 0))))) R (((p9 <= 0) OR (p92 <= 0)) AND ((p1 <= 0) OR (p109 <= 0)))))
lola: processed formula length: 124
lola: 119 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 9 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 5 markings, 4 edges
lola: ========================================
lola: subprocess 5 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (F ((p52 <= 0))) OR (1 <= p59))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p59)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p59)
lola: processed formula length: 10
lola: 119 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 6 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((p52 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((p52 <= 0)))
lola: processed formula length: 18
lola: 119 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2 markings, 1 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 6 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X (F (((p12 <= 0) OR (p35 <= 0)))) AND ((p12 <= 0) OR (p35 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (F (((p12 <= 0) OR (p35 <= 0)))) AND ((p12 <= 0) OR (p35 <= 0))))
lola: processed formula length: 73
lola: 119 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 4 markings, 3 edges
lola: ========================================
lola: subprocess 7 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G (((1 <= p104) OR (1 <= p19))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G (((1 <= p104) OR (1 <= p19))))
lola: processed formula length: 36
lola: 119 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 25 markings, 25 edges
lola: ========================================
lola: subprocess 8 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((X (F (((1 <= p15) AND (1 <= p51)))) AND (F ((((p15 <= 0) OR (p51 <= 0)) AND (F (G (((p27 <= 0) OR (p54 <= 0)))) OR G (((p15 <= 0) OR (p51 <= 0)))))) OR G (F (((1 <= p15) AND (1 <= p51)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((X (F (((1 <= p15) AND (1 <= p51)))) AND (F ((((p15 <= 0) OR (p51 <= 0)) AND (F (G (((p27 <= 0) OR (p54 <= 0)))) OR G (((p15 <= 0) OR (p51 <= 0)))))) OR G (F (((1 <= p15) AND (1 <= p51)))))))
lola: processed formula length: 197
lola: 119 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 12 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 25 markings, 25 edges
lola: ========================================
lola: subprocess 9 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X ((G ((p19 <= 0)) OR F (((p9 <= 0) OR (p105 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X ((G ((p19 <= 0)) OR F (((p9 <= 0) OR (p105 <= 0))))))
lola: processed formula length: 59
lola: 119 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 3 markings, 2 edges
lola: ========================================
lola: subprocess 10 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F ((G (((p6 <= 0) OR (p41 <= 0))) OR ((p20 <= 0) AND ((p6 <= 0) OR (p41 <= 0))))) OR ((p79 <= 0) OR (p98 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F ((G (((p6 <= 0) OR (p41 <= 0))) OR ((p20 <= 0) AND ((p6 <= 0) OR (p41 <= 0))))) OR ((p79 <= 0) OR (p98 <= 0)))))
lola: processed formula length: 123
lola: 119 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 3708 markings, 4103 edges
lola: ========================================
lola: subprocess 11 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((G ((G (((p76 <= 0) OR (p85 <= 0))) OR ((p63 <= 0) OR (p90 <= 0)))) AND (1 <= p81))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((G ((G (((p76 <= 0) OR (p85 <= 0))) OR ((p63 <= 0) OR (p90 <= 0)))) AND (1 <= p81))))
lola: processed formula length: 92
lola: 119 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 26 markings, 28 edges
lola: RESULT
lola:
SUMMARY: no yes yes yes yes no yes yes yes no no yes
lola:
preliminary result: no yes yes yes yes no yes yes yes no no yes
lola: ========================================
lola: memory consumption: 26032 KB
lola: time consumption: 3 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLFireability.json
lola: closed JSON file LTLFireability.json
rslt: finished
--------------------
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="DoubleExponent-PT-002"
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 DoubleExponent-PT-002, 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 r178-tajo-158987882800754"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DoubleExponent-PT-002.tgz
mv DoubleExponent-PT-002 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 ;