About the Execution of 2020-gold for QuasiCertifProtocol-PT-06
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 4280.180 | 3600000.00 | 30443.00 | 73.50 | FFFFTFFTFFFFTFTF | 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/mcc2021-input.r189-tajo-162089432400037.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2021-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 gold2020
Input is QuasiCertifProtocol-PT-06, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r189-tajo-162089432400037
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 60K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 430K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 25K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 167K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 8.2K Mar 28 16:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 47K Mar 28 16:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Mar 28 16:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 28 16:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.8K Mar 27 09:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 27 09:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.2K Mar 25 13:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 25 13:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Mar 22 08:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K Mar 22 08:13 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 153K May 5 16:51 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 QuasiCertifProtocol-PT-06-00
FORMULA_NAME QuasiCertifProtocol-PT-06-01
FORMULA_NAME QuasiCertifProtocol-PT-06-02
FORMULA_NAME QuasiCertifProtocol-PT-06-03
FORMULA_NAME QuasiCertifProtocol-PT-06-04
FORMULA_NAME QuasiCertifProtocol-PT-06-05
FORMULA_NAME QuasiCertifProtocol-PT-06-06
FORMULA_NAME QuasiCertifProtocol-PT-06-07
FORMULA_NAME QuasiCertifProtocol-PT-06-08
FORMULA_NAME QuasiCertifProtocol-PT-06-09
FORMULA_NAME QuasiCertifProtocol-PT-06-10
FORMULA_NAME QuasiCertifProtocol-PT-06-11
FORMULA_NAME QuasiCertifProtocol-PT-06-12
FORMULA_NAME QuasiCertifProtocol-PT-06-13
FORMULA_NAME QuasiCertifProtocol-PT-06-14
FORMULA_NAME QuasiCertifProtocol-PT-06-15
=== Now, execution of the tool begins
BK_START 1621408839169
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-19 07:20:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2021-05-19 07:20:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-19 07:20:40] [INFO ] Load time of PNML (sax parser for PT used): 55 ms
[2021-05-19 07:20:40] [INFO ] Transformed 270 places.
[2021-05-19 07:20:40] [INFO ] Transformed 116 transitions.
[2021-05-19 07:20:40] [INFO ] Parsed PT model containing 270 places and 116 transitions in 91 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 22 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 9839 resets, run finished after 658 ms. (steps per millisecond=151 ) properties seen :[0, 0, 1, 1, 0, 0, 0, 0, 0, 1, 0, 1, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1]
// Phase 1: matrix 116 rows 270 cols
[2021-05-19 07:20:41] [INFO ] Computed 155 place invariants in 17 ms
[2021-05-19 07:20:41] [INFO ] [Real]Absence check using 3 positive place invariants in 19 ms returned sat
[2021-05-19 07:20:41] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 75 ms returned sat
[2021-05-19 07:20:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:20:42] [INFO ] [Real]Absence check using state equation in 256 ms returned sat
[2021-05-19 07:20:42] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 14 ms.
[2021-05-19 07:20:42] [INFO ] Added : 48 causal constraints over 10 iterations in 155 ms. Result :sat
[2021-05-19 07:20:42] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2021-05-19 07:20:42] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 41 ms returned sat
[2021-05-19 07:20:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:20:42] [INFO ] [Real]Absence check using state equation in 181 ms returned sat
[2021-05-19 07:20:42] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 11 ms.
[2021-05-19 07:20:42] [INFO ] Added : 34 causal constraints over 7 iterations in 92 ms. Result :sat
[2021-05-19 07:20:42] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2021-05-19 07:20:42] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 39 ms returned sat
[2021-05-19 07:20:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:20:43] [INFO ] [Real]Absence check using state equation in 226 ms returned sat
[2021-05-19 07:20:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 07:20:43] [INFO ] [Nat]Absence check using 3 positive place invariants in 7 ms returned sat
[2021-05-19 07:20:43] [INFO ] [Nat]Absence check using 3 positive and 152 generalized place invariants in 39 ms returned sat
[2021-05-19 07:20:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 07:20:43] [INFO ] [Nat]Absence check using state equation in 168 ms returned sat
[2021-05-19 07:20:43] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 15 ms.
[2021-05-19 07:20:43] [INFO ] Added : 20 causal constraints over 4 iterations in 68 ms. Result :sat
[2021-05-19 07:20:43] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned unsat
[2021-05-19 07:20:43] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2021-05-19 07:20:43] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 36 ms returned sat
[2021-05-19 07:20:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:20:43] [INFO ] [Real]Absence check using state equation in 142 ms returned sat
[2021-05-19 07:20:43] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 18 ms.
[2021-05-19 07:20:43] [INFO ] Added : 47 causal constraints over 10 iterations in 191 ms. Result :sat
[2021-05-19 07:20:43] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2021-05-19 07:20:43] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 49 ms returned sat
[2021-05-19 07:20:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:20:44] [INFO ] [Real]Absence check using state equation in 195 ms returned sat
[2021-05-19 07:20:44] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 07:20:44] [INFO ] [Nat]Absence check using 3 positive place invariants in 12 ms returned sat
[2021-05-19 07:20:44] [INFO ] [Nat]Absence check using 3 positive and 152 generalized place invariants in 48 ms returned sat
[2021-05-19 07:20:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 07:20:44] [INFO ] [Nat]Absence check using state equation in 224 ms returned sat
[2021-05-19 07:20:44] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 8 ms.
[2021-05-19 07:20:44] [INFO ] Added : 51 causal constraints over 11 iterations in 139 ms. Result :sat
[2021-05-19 07:20:44] [INFO ] [Real]Absence check using 3 positive place invariants in 8 ms returned sat
[2021-05-19 07:20:44] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 65 ms returned sat
[2021-05-19 07:20:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:20:44] [INFO ] [Real]Absence check using state equation in 200 ms returned sat
[2021-05-19 07:20:44] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 07:20:45] [INFO ] [Nat]Absence check using 3 positive place invariants in 7 ms returned sat
[2021-05-19 07:20:45] [INFO ] [Nat]Absence check using 3 positive and 152 generalized place invariants in 51 ms returned sat
[2021-05-19 07:20:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 07:20:45] [INFO ] [Nat]Absence check using state equation in 177 ms returned sat
[2021-05-19 07:20:45] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 8 ms.
[2021-05-19 07:20:45] [INFO ] Added : 24 causal constraints over 5 iterations in 89 ms. Result :sat
[2021-05-19 07:20:45] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2021-05-19 07:20:45] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 42 ms returned sat
[2021-05-19 07:20:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:20:45] [INFO ] [Real]Absence check using state equation in 157 ms returned sat
[2021-05-19 07:20:45] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 9 ms.
[2021-05-19 07:20:45] [INFO ] Added : 61 causal constraints over 13 iterations in 172 ms. Result :sat
[2021-05-19 07:20:45] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned unsat
[2021-05-19 07:20:45] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2021-05-19 07:20:45] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 37 ms returned sat
[2021-05-19 07:20:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:20:46] [INFO ] [Real]Absence check using state equation in 172 ms returned sat
[2021-05-19 07:20:46] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 13 ms.
[2021-05-19 07:20:46] [INFO ] Added : 9 causal constraints over 2 iterations in 46 ms. Result :sat
[2021-05-19 07:20:46] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned unsat
[2021-05-19 07:20:46] [INFO ] [Real]Absence check using 3 positive place invariants in 8 ms returned sat
[2021-05-19 07:20:46] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 64 ms returned sat
[2021-05-19 07:20:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:20:46] [INFO ] [Real]Absence check using state equation in 178 ms returned sat
[2021-05-19 07:20:46] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 07:20:46] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2021-05-19 07:20:46] [INFO ] [Nat]Absence check using 3 positive and 152 generalized place invariants in 45 ms returned sat
[2021-05-19 07:20:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 07:20:46] [INFO ] [Nat]Absence check using state equation in 161 ms returned sat
[2021-05-19 07:20:46] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 9 ms.
[2021-05-19 07:20:46] [INFO ] Added : 27 causal constraints over 6 iterations in 64 ms. Result :sat
[2021-05-19 07:20:46] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2021-05-19 07:20:46] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 56 ms returned sat
[2021-05-19 07:20:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:20:47] [INFO ] [Real]Absence check using state equation in 207 ms returned sat
[2021-05-19 07:20:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 07:20:47] [INFO ] [Nat]Absence check using 3 positive place invariants in 14 ms returned sat
[2021-05-19 07:20:47] [INFO ] [Nat]Absence check using 3 positive and 152 generalized place invariants in 42 ms returned sat
[2021-05-19 07:20:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 07:20:47] [INFO ] [Nat]Absence check using state equation in 163 ms returned sat
[2021-05-19 07:20:47] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 9 ms.
[2021-05-19 07:20:47] [INFO ] Added : 47 causal constraints over 10 iterations in 107 ms. Result :sat
[2021-05-19 07:20:47] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned unsat
[2021-05-19 07:20:47] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2021-05-19 07:20:47] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 51 ms returned sat
[2021-05-19 07:20:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:20:47] [INFO ] [Real]Absence check using state equation in 41 ms returned unsat
[2021-05-19 07:20:47] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2021-05-19 07:20:47] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 62 ms returned sat
[2021-05-19 07:20:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:20:47] [INFO ] [Real]Absence check using state equation in 196 ms returned sat
[2021-05-19 07:20:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 07:20:47] [INFO ] [Nat]Absence check using 3 positive place invariants in 7 ms returned sat
[2021-05-19 07:20:48] [INFO ] [Nat]Absence check using 3 positive and 152 generalized place invariants in 51 ms returned sat
[2021-05-19 07:20:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 07:20:48] [INFO ] [Nat]Absence check using state equation in 191 ms returned sat
[2021-05-19 07:20:48] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 8 ms.
[2021-05-19 07:20:48] [INFO ] Added : 28 causal constraints over 6 iterations in 68 ms. Result :sat
[2021-05-19 07:20:48] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2021-05-19 07:20:48] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 37 ms returned sat
[2021-05-19 07:20:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:20:48] [INFO ] [Real]Absence check using state equation in 145 ms returned sat
[2021-05-19 07:20:48] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 6 ms.
[2021-05-19 07:20:48] [INFO ] Added : 49 causal constraints over 10 iterations in 91 ms. Result :sat
[2021-05-19 07:20:48] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2021-05-19 07:20:48] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 49 ms returned sat
[2021-05-19 07:20:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:20:48] [INFO ] [Real]Absence check using state equation in 174 ms returned sat
[2021-05-19 07:20:48] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 07:20:48] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2021-05-19 07:20:48] [INFO ] [Nat]Absence check using 3 positive and 152 generalized place invariants in 40 ms returned sat
[2021-05-19 07:20:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 07:20:49] [INFO ] [Nat]Absence check using state equation in 145 ms returned sat
[2021-05-19 07:20:49] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 5 ms.
[2021-05-19 07:20:49] [INFO ] Added : 14 causal constraints over 3 iterations in 32 ms. Result :sat
[2021-05-19 07:20:49] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned unsat
[2021-05-19 07:20:49] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned unsat
[2021-05-19 07:20:49] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2021-05-19 07:20:49] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 56 ms returned sat
[2021-05-19 07:20:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:20:49] [INFO ] [Real]Absence check using state equation in 158 ms returned sat
[2021-05-19 07:20:49] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 07:20:49] [INFO ] [Nat]Absence check using 3 positive place invariants in 10 ms returned sat
[2021-05-19 07:20:49] [INFO ] [Nat]Absence check using 3 positive and 152 generalized place invariants in 61 ms returned sat
[2021-05-19 07:20:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 07:20:49] [INFO ] [Nat]Absence check using state equation in 196 ms returned sat
[2021-05-19 07:20:49] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 7 ms.
[2021-05-19 07:20:49] [INFO ] Added : 13 causal constraints over 3 iterations in 40 ms. Result :sat
[2021-05-19 07:20:49] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2021-05-19 07:20:49] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 44 ms returned sat
[2021-05-19 07:20:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:20:49] [INFO ] [Real]Absence check using state equation in 35 ms returned unsat
[2021-05-19 07:20:49] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2021-05-19 07:20:50] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 65 ms returned sat
[2021-05-19 07:20:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:20:50] [INFO ] [Real]Absence check using state equation in 179 ms returned unsat
[2021-05-19 07:20:50] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2021-05-19 07:20:50] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 53 ms returned sat
[2021-05-19 07:20:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:20:50] [INFO ] [Real]Absence check using state equation in 195 ms returned sat
[2021-05-19 07:20:50] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 07:20:50] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2021-05-19 07:20:50] [INFO ] [Nat]Absence check using 3 positive and 152 generalized place invariants in 47 ms returned sat
[2021-05-19 07:20:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 07:20:50] [INFO ] [Nat]Absence check using state equation in 214 ms returned sat
[2021-05-19 07:20:50] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 8 ms.
[2021-05-19 07:20:50] [INFO ] Added : 50 causal constraints over 10 iterations in 130 ms. Result :sat
[2021-05-19 07:20:50] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2021-05-19 07:20:51] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 48 ms returned sat
[2021-05-19 07:20:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:20:51] [INFO ] [Real]Absence check using state equation in 166 ms returned unsat
[2021-05-19 07:20:51] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2021-05-19 07:20:51] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 54 ms returned sat
[2021-05-19 07:20:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:20:51] [INFO ] [Real]Absence check using state equation in 196 ms returned sat
[2021-05-19 07:20:51] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 07:20:51] [INFO ] [Nat]Absence check using 3 positive place invariants in 10 ms returned sat
[2021-05-19 07:20:51] [INFO ] [Nat]Absence check using 3 positive and 152 generalized place invariants in 60 ms returned sat
[2021-05-19 07:20:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 07:20:51] [INFO ] [Nat]Absence check using state equation in 192 ms returned sat
[2021-05-19 07:20:51] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 11 ms.
[2021-05-19 07:20:51] [INFO ] Added : 50 causal constraints over 10 iterations in 107 ms. Result :sat
[2021-05-19 07:20:51] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2021-05-19 07:20:51] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 50 ms returned sat
[2021-05-19 07:20:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:20:52] [INFO ] [Real]Absence check using state equation in 197 ms returned sat
[2021-05-19 07:20:52] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 07:20:52] [INFO ] [Nat]Absence check using 3 positive place invariants in 8 ms returned sat
[2021-05-19 07:20:52] [INFO ] [Nat]Absence check using 3 positive and 152 generalized place invariants in 55 ms returned sat
[2021-05-19 07:20:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 07:20:52] [INFO ] [Nat]Absence check using state equation in 186 ms returned sat
[2021-05-19 07:20:52] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 6 ms.
[2021-05-19 07:20:52] [INFO ] Added : 52 causal constraints over 11 iterations in 108 ms. Result :sat
[2021-05-19 07:20:52] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2021-05-19 07:20:52] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 48 ms returned sat
[2021-05-19 07:20:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 07:20:52] [INFO ] [Real]Absence check using state equation in 158 ms returned sat
[2021-05-19 07:20:52] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 07:20:52] [INFO ] [Nat]Absence check using 3 positive place invariants in 7 ms returned sat
[2021-05-19 07:20:52] [INFO ] [Nat]Absence check using 3 positive and 152 generalized place invariants in 48 ms returned sat
[2021-05-19 07:20:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 07:20:53] [INFO ] [Nat]Absence check using state equation in 185 ms returned sat
[2021-05-19 07:20:53] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints in 6 ms.
[2021-05-19 07:20:53] [INFO ] Added : 49 causal constraints over 10 iterations in 120 ms. Result :sat
Successfully simplified 10 atomic propositions for a total of 10 simplifications.
[2021-05-19 07:20:53] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2021-05-19 07:20:53] [INFO ] Flatten gal took : 47 ms
FORMULA QuasiCertifProtocol-PT-06-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-06-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-06-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-06-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-06-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-06-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-19 07:20:53] [INFO ] Flatten gal took : 18 ms
[2021-05-19 07:20:53] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2021-05-19 07:20:53] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 3 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ QuasiCertifProtocol-PT-06 @ 3570 seconds
FORMULA QuasiCertifProtocol-PT-06-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA QuasiCertifProtocol-PT-06-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA QuasiCertifProtocol-PT-06-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA QuasiCertifProtocol-PT-06-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA QuasiCertifProtocol-PT-06-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA QuasiCertifProtocol-PT-06-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA QuasiCertifProtocol-PT-06-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA QuasiCertifProtocol-PT-06-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA QuasiCertifProtocol-PT-06-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA QuasiCertifProtocol-PT-06-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3565
rslt: Output for LTLCardinality @ QuasiCertifProtocol-PT-06
{
"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=LTLCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed May 19 07:20:53 2021
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 1,
"X": 3,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 70,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 66,
"visible_transitions": 0
},
"processed": "X (G ((F ((p267 <= p55)) AND (X (F ((((p1 + p2 + p3 + p4 + p5 + p6 + p7 <= p161 + p162 + p163 + p173 + p175 + p176 + p177 + p205 + p206 + p204 + p203 + p209 + p210 + p211 + p212 + p213 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p202 + p201 + p200 + p199 + p198 + p197 + p196 + p195 + p194 + p193 + p192 + p191 + p190 + p189 + p188 + p187 + p186 + p185 + p184 + p183 + p182 + p181 + p180 + p179 + p178 + p174) U G ((p267 <= p55))) OR X ((p254 + p255 + p257 + p258 + p259 + p260 + p261 <= p15))))) OR (p267 <= p55)))))",
"processed_size": 524,
"rewrites": 46
},
"result":
{
"edges": 1036494,
"markings": 197272,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"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": 396
},
"child":
[
{
"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": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 21,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 21,
"visible_transitions": 0
},
"processed": "F ((X ((p170 + p169 + p164 + p160 + p159 + p158 + p157 <= p230 + p229 + p228 + p227 + p226 + p225 + p231)) OR (3 <= p101 + p102 + p112 + p114 + p115 + p116 + p113)))",
"processed_size": 165,
"rewrites": 46
},
"result":
{
"edges": 10,
"markings": 10,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 1,
"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": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 63,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 63,
"visible_transitions": 0
},
"processed": "X (G (((p51 + p50 + p48 + p47 + p46 + p45 + p52 <= p161 + p162 + p163 + p173 + p175 + p176 + p177 + p205 + p206 + p204 + p203 + p209 + p210 + p211 + p212 + p213 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p202 + p201 + p200 + p199 + p198 + p197 + p196 + p195 + p194 + p193 + p192 + p191 + p190 + p189 + p188 + p187 + p186 + p185 + p184 + p183 + p182 + p181 + p180 + p179 + p178 + p174) OR (1 <= p9 + p16 + p14 + p13 + p12 + p11 + p10))))",
"processed_size": 445,
"rewrites": 46
},
"result":
{
"edges": 10,
"markings": 10,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 3,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 3,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 168,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 56,
"visible_transitions": 0
},
"processed": "X (G (((p161 + p162 + p163 + p173 + p175 + p176 + p177 + p205 + p206 + p204 + p203 + p209 + p210 + p211 + p212 + p213 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p202 + p201 + p200 + p199 + p198 + p197 + p196 + p195 + p194 + p193 + p192 + p191 + p190 + p189 + p188 + p187 + p186 + p185 + p184 + p183 + p182 + p181 + p180 + p179 + p178 + p174 + 1 <= p24 + p22 + p21 + p20 + p19 + p18 + p17) AND (G ((p161 + p162 + p163 + p173 + p175 + p176 + p177 + p205 + p206 + p204 + p203 + p209 + p210 + p211 + p212 + p213 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p202 + p201 + p200 + p199 + p198 + p197 + p196 + p195 + p194 + p193 + p192 + p191 + p190 + p189 + p188 + p187 + p186 + p185 + p184 + p183 + p182 + p181 + p180 + p179 + p178 + p174 + 1 <= p24 + p22 + p21 + p20 + p19 + p18 + p17)) OR G (F ((p161 + p162 + p163 + p173 + p175 + p176 + p177 + p205 + p206 + p204 + p203 + p209 + p210 + p211 + p212 + p213 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p202 + p201 + p200 + p199 + p198 + p197 + p196 + p195 + p194 + p193 + p192 + p191 + p190 + p189 + p188 + p187 + p186 + p185 + p184 + p183 + p182 + p181 + p180 + p179 + p178 + p174 + 1 <= p24 + p22 + p21 + p20 + p19 + p18 + p17)))))))",
"processed_size": 1200,
"rewrites": 46
},
"result":
{
"edges": 10,
"markings": 10,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"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": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 0,
"U": 0,
"X": 3,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X ((((p234 + 1 <= p123) R F ((p234 + 1 <= p123))) OR X (X (F ((p230 <= p54))))))",
"processed_size": 80,
"rewrites": 46
},
"result":
{
"edges": 137,
"markings": 70,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"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": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 2,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "G ((X (X (F (((p259 <= 0) OR (p49 + 1 <= p142))))) OR (p56 <= p195)))",
"processed_size": 70,
"rewrites": 46
},
"result":
{
"edges": 272654,
"markings": 58171,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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": 713
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"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": "G (F ((p41 <= p5)))",
"processed_size": 19,
"rewrites": 46
},
"result":
{
"edges": 1214,
"markings": 397,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (X (((1 <= p15) OR (G ((p245 <= p55)) AND F ((1 <= p15))))))",
"processed_size": 62,
"rewrites": 46
},
"result":
{
"edges": 40531,
"markings": 9519,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"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": false
},
"task":
{
"compoundnumber": 5,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 4,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X ((X (X (X (F ((p258 <= p1))))) OR G ((p49 <= p60))))",
"processed_size": 54,
"rewrites": 46
},
"result":
{
"edges": 1710,
"markings": 640,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 8
},
"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": 1188
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"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 ((p87 + 1 <= p0)))",
"processed_size": 23,
"rewrites": 46
},
"result":
{
"edges": 10,
"markings": 10,
"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": 1782
},
"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": 7,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "(p264 + p262 + p263 + p265 + p266 + p268 + p269 <= 0)",
"processed_size": 53,
"rewrites": 48
},
"result":
{
"edges": 10,
"markings": 11,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 7
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3565
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"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": "G (F ((1 <= p48)))",
"processed_size": 18,
"rewrites": 46
},
"result":
{
"edges": 11,
"markings": 11,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 24376,
"runtime": 5.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "F(**) : X(G((F(**) AND (X(F(((** U G(**)) OR X(**)))) OR **)))) : (F((X(**) OR **)) OR X(G(**))) : X(G((* AND (G(*) OR G(F(*)))))) : G(F(*)) : X(((* R F(*)) OR X(X(F(**))))) : G((X(X(F(*))) OR **)) : (X(X((** OR (G(**) AND F(**))))) OR G(F(**))) : X((X(X(X(F(**)))) OR G(**))) : X(G(*))"
},
"net":
{
"arcs": 659,
"conflict_clusters": 32,
"places": 270,
"places_significant": 115,
"singleton_clusters": 0,
"transitions": 116
},
"result":
{
"preliminary_value": "no no no no no no no no yes no ",
"value": "no no no no no no no no yes no "
},
"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: 386/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 8640
lola: finding significant places
lola: 270 places, 116 transitions, 115 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 LTLCardinality.xml
lola: LP says that atomic proposition is always false: (3 <= p49)
lola: F ((1 <= p264 + p262 + p263 + p265 + p266 + p268 + p269)) : G (X ((X (((0 <= 0) U F ((((p1 + p2 + p3 + p4 + p5 + p6 + p7 <= p161 + p162 + p163 + p173 + p175 + p176 + p177 + p205 + p206 + p204 + p203 + p209 + p210 + p211 + p212 + p213 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p202 + p201 + p200 + p199 + p198 + p197 + p196 + p195 + p194 + p193 + p192 + p191 + p190 + p189 + p188 + p187 + p186 + p185 + p184 + p183 + p182 + p181 + p180 + p179 + p178 + p174) U G ((p267 <= p55))) OR X ((p254 + p255 + p257 + p258 + p259 + p260 + p261 <= p15)))))) U (p267 <= p55)))) : (F ((X ((p170 + p169 + p164 + p160 + p159 + p158 + p157 <= p230 + p229 + p228 + p227 + p226 + p225 + p231)) OR (3 <= p101 + p102 + p112 + p114 + p115 + p116 + p113))) OR X (G (((p51 + p50 + p48 + p47 + p46 + p45 + p52 <= p161 + p162 + p163 + p173 + p175 + p176 + p177 + p205 + p206 + p204 + p203 + p209 + p210 + p211 + p212 + p213 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p202 + p201 + p200 + p199 + p198 + p197 + p196 + p195 + p194 + p193 + p192 + p191 + p190 + p189 + p188 + p187 + p186 + p185 + p184 + p183 + p182 + p181 + p180 + p179 + p178 + p174) OR (1 <= p9 + p16 + p14 + p13 + p12 + p11 + p10))))) : G (X (NOT((F (F (G ((p24 + p22 + p21 + p20 + p19 + p18 + p17 <= p161 + p162 + p163 + p173 + p175 + p176 + p177 + p205 + p206 + p204 + p203 + p209 + p210 + p211 + p212 + p213 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p202 + p201 + p200 + p199 + p198 + p197 + p196 + p195 + p194 + p193 + p192 + p191 + p190 + p189 + p188 + p187 + p186 + p185 + p184 + p183 + p182 + p181 + p180 + p179 + p178 + p174)))) U (p24 + p22 + p21 + p20 + p19 + p18 + p17 <= p161 + p162 + p163 + p173 + p175 + p176 + p177 + p205 + p206 + p204 + p203 + p209 + p210 + p211 + p212 + p213 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p202 + p201 + p200 + p199 + p198 + p197 + p196 + p195 + p194 + p193 + p192 + p191 + p190 + p189 + p188 + p187 + p186 + p185 + p184 + p183 + p182 + p181 + p180 + p179 + p178 + p174))))) : F (G (NOT(G ((p48 <= 0))))) : NOT(X ((((p123 <= p234) U G ((p123 <= p234))) AND G (X (NOT(X ((p230 <= p54)))))))) : G ((F (X (NOT(X (((1 <= p259) AND (p142 <= p49)))))) OR (p56 <= p195))) : (X (X ((G ((p245 <= p55)) U (1 <= p15)))) OR (F ((p41 <= p5)) U G (F ((p41 <= p5))))) : X ((X (F (X (X ((p258 <= p1))))) OR G ((p49 <= p60)))) : X (NOT((F ((((p264 <= p226)) U (p267 <= p0))) U F ((p0 <= p87)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:428
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: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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:338
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: rewrite Frontend/Parser/formula_rewrite.k:335
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:425
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((F ((p267 <= p55)) AND (X (F ((((p1 + p2 + p3 + p4 + p5 + p6 + p7 <= p161 + p162 + p163 + p173 + p175 + p176 + p177 + p205 + p206 + p204 + p203 + p209 + p210 + p211 + p212 + p213 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p202 + p201 + p200 + p199 + p198 + p197 + p196 + p195 + p194 + p193 + p192 + p191 + p190 + p189 + p188 + p187 + p186 + p185 + p184 + p183 + p182 + p181 + p180 + p17... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((F ((p267 <= p55)) AND (X (F ((((p1 + p2 + p3 + p4 + p5 + p6 + p7 <= p161 + p162 + p163 + p173 + p175 + p176 + p177 + p205 + p206 + p204 + p203 + p209 + p210 + p211 + p212 + p213 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p202 + p201 + p200 + p199 + p198 + p197 + p196 + p195 + p194 + p193 + p192 + p191 + p190 + p189 + p188 + p187 + p186 + p185 + p184 + p183 + p182 + p181 + p180 + p17... (shortened)
lola: processed formula length: 524
lola: 46 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 6 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: 197272 markings, 1036494 edges
lola: ========================================
lola: subprocess 1 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((X ((p170 + p169 + p164 + p160 + p159 + p158 + p157 <= p230 + p229 + p228 + p227 + p226 + p225 + p231)) OR (3 <= p101 + p102 + p112 + p114 + p115 + p116 + p113))) OR X (G (((p51 + p50 + p48 + p47 + p46 + p45 + p52 <= p161 + p162 + p163 + p173 + p175 + p176 + p177 + p205 + p206 + p204 + p203 + p209 + p210 + p211 + p212 + p213 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p202 + p201 + p200... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((X ((p170 + p169 + p164 + p160 + p159 + p158 + p157 <= p230 + p229 + p228 + p227 + p226 + p225 + p231)) OR (3 <= p101 + p102 + p112 + p114 + p115 + p116 + p113)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((X ((p170 + p169 + p164 + p160 + p159 + p158 + p157 <= p230 + p229 + p228 + p227 + p226 + p225 + p231)) OR (3 <= p101 + p102 + p112 + p114 + p115 + p116 + p113)))
lola: processed formula length: 165
lola: 46 rewrites
lola: closed formula file LTLCardinality.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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 10 markings, 10 edges
lola: ========================================
lola: subprocess 2 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G (((p51 + p50 + p48 + p47 + p46 + p45 + p52 <= p161 + p162 + p163 + p173 + p175 + p176 + p177 + p205 + p206 + p204 + p203 + p209 + p210 + p211 + p212 + p213 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p202 + p201 + p200 + p199 + p198 + p197 + p196 + p195 + p194 + p193 + p192 + p191 + p190 + p189 + p188 + p187 + p186 + p185 + p184 + p183 + p182 + p181 + p180 + p179 + p178 + p174) OR (1 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G (((p51 + p50 + p48 + p47 + p46 + p45 + p52 <= p161 + p162 + p163 + p173 + p175 + p176 + p177 + p205 + p206 + p204 + p203 + p209 + p210 + p211 + p212 + p213 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p202 + p201 + p200 + p199 + p198 + p197 + p196 + p195 + p194 + p193 + p192 + p191 + p190 + p189 + p188 + p187 + p186 + p185 + p184 + p183 + p182 + p181 + p180 + p179 + p178 + p174) OR (1 ... (shortened)
lola: processed formula length: 445
lola: 46 rewrites
lola: closed formula file LTLCardinality.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: 10 markings, 10 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G (((p161 + p162 + p163 + p173 + p175 + p176 + p177 + p205 + p206 + p204 + p203 + p209 + p210 + p211 + p212 + p213 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p202 + p201 + p200 + p199 + p198 + p197 + p196 + p195 + p194 + p193 + p192 + p191 + p190 + p189 + p188 + p187 + p186 + p185 + p184 + p183 + p182 + p181 + p180 + p179 + p178 + p174 + 1 <= p24 + p22 + p21 + p20 + p19 + p18 + p17) AND... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G (((p161 + p162 + p163 + p173 + p175 + p176 + p177 + p205 + p206 + p204 + p203 + p209 + p210 + p211 + p212 + p213 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p202 + p201 + p200 + p199 + p198 + p197 + p196 + p195 + p194 + p193 + p192 + p191 + p190 + p189 + p188 + p187 + p186 + p185 + p184 + p183 + p182 + p181 + p180 + p179 + p178 + p174 + 1 <= p24 + p22 + p21 + p20 + p19 + p18 + p17) AND... (shortened)
lola: processed formula length: 1200
lola: 46 rewrites
lola: closed formula file LTLCardinality.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: 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: 10 markings, 10 edges
lola: ========================================
lola: subprocess 3 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((((p234 + 1 <= p123) R F ((p234 + 1 <= p123))) OR X (X (F ((p230 <= p54))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((((p234 + 1 <= p123) R F ((p234 + 1 <= p123))) OR X (X (F ((p230 <= p54))))))
lola: processed formula length: 80
lola: 46 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 6 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: 70 markings, 137 edges
lola: ========================================
lola: subprocess 4 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((X (X (F (((p259 <= 0) OR (p49 + 1 <= p142))))) OR (p56 <= p195)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((X (X (F (((p259 <= 0) OR (p49 + 1 <= p142))))) OR (p56 <= p195)))
lola: processed formula length: 70
lola: 46 rewrites
lola: closed formula file LTLCardinality.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: 58171 markings, 272654 edges
lola: ========================================
lola: subprocess 5 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (X (((1 <= p15) OR (G ((p245 <= p55)) AND F ((1 <= p15)))))) OR G (F ((p41 <= p5))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((p41 <= p5)))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((p41 <= p5)))
lola: processed formula length: 19
lola: 46 rewrites
lola: closed formula file LTLCardinality.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: 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: 397 markings, 1214 edges
lola: ========================================
lola: subprocess 6 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (((1 <= p15) OR (G ((p245 <= p55)) AND F ((1 <= p15))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (((1 <= p15) OR (G ((p245 <= p55)) AND F ((1 <= p15))))))
lola: processed formula length: 62
lola: 46 rewrites
lola: closed formula file LTLCardinality.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: 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: 9519 markings, 40531 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 6 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X (X (X (F ((p258 <= p1))))) OR G ((p49 <= p60))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (X (X (F ((p258 <= p1))))) OR G ((p49 <= p60))))
lola: processed formula length: 54
lola: 46 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 8 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: 640 markings, 1710 edges
lola: ========================================
lola: subprocess 7 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((p87 + 1 <= p0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((p87 + 1 <= p0)))
lola: processed formula length: 23
lola: 46 rewrites
lola: closed formula file LTLCardinality.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: 10 markings, 10 edges
lola: ========================================
lola: subprocess 8 will run for 1782 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((1 <= p264 + p262 + p263 + p265 + p266 + p268 + p269))
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: (p264 + p262 + p263 + p265 + p266 + p268 + p269 <= 0)
lola: processed formula length: 53
lola: 48 rewrites
lola: closed formula file LTLCardinality.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: 11 markings, 10 edges
lola: ========================================
lola: subprocess 9 will run for 3565 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((1 <= p48)))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((1 <= p48)))
lola: processed formula length: 18
lola: 46 rewrites
lola: closed formula file LTLCardinality.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: 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: 11 markings, 11 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no no no no no yes no
lola:
preliminary result: no no no no no no no no yes no
lola: memory consumption: 24376 KB
lola: time consumption: 5 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.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="QuasiCertifProtocol-PT-06"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2020"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool gold2020"
echo " Input is QuasiCertifProtocol-PT-06, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r189-tajo-162089432400037"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-PT-06.tgz
mv QuasiCertifProtocol-PT-06 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;