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-158987882800755.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 CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-tajo-158987882800755
=====================================================================

--------------------
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-CTLCardinality-00
FORMULA_NAME DoubleExponent-PT-002-CTLCardinality-01
FORMULA_NAME DoubleExponent-PT-002-CTLCardinality-02
FORMULA_NAME DoubleExponent-PT-002-CTLCardinality-03
FORMULA_NAME DoubleExponent-PT-002-CTLCardinality-04
FORMULA_NAME DoubleExponent-PT-002-CTLCardinality-05
FORMULA_NAME DoubleExponent-PT-002-CTLCardinality-06
FORMULA_NAME DoubleExponent-PT-002-CTLCardinality-07
FORMULA_NAME DoubleExponent-PT-002-CTLCardinality-08
FORMULA_NAME DoubleExponent-PT-002-CTLCardinality-09
FORMULA_NAME DoubleExponent-PT-002-CTLCardinality-10
FORMULA_NAME DoubleExponent-PT-002-CTLCardinality-11
FORMULA_NAME DoubleExponent-PT-002-CTLCardinality-12
FORMULA_NAME DoubleExponent-PT-002-CTLCardinality-13
FORMULA_NAME DoubleExponent-PT-002-CTLCardinality-14
FORMULA_NAME DoubleExponent-PT-002-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1591239071722

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 02:51:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-04 02:51:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 02:51:14] [INFO ] Load time of PNML (sax parser for PT used): 46 ms
[2020-06-04 02:51:14] [INFO ] Transformed 110 places.
[2020-06-04 02:51:14] [INFO ] Transformed 98 transitions.
[2020-06-04 02:51:14] [INFO ] Parsed PT model containing 110 places and 98 transitions in 83 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 22 ms.
Incomplete random walk after 100000 steps, including 3332 resets, run finished after 221 ms. (steps per millisecond=452 ) properties seen :[0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0]
// Phase 1: matrix 98 rows 110 cols
[2020-06-04 02:51:14] [INFO ] Computed 14 place invariants in 9 ms
[2020-06-04 02:51:14] [INFO ] [Real]Absence check using 5 positive place invariants in 20 ms returned unsat
[2020-06-04 02:51:14] [INFO ] [Real]Absence check using 5 positive place invariants in 7 ms returned unsat
[2020-06-04 02:51:14] [INFO ] [Real]Absence check using 5 positive place invariants in 9 ms returned unsat
[2020-06-04 02:51:14] [INFO ] [Real]Absence check using 5 positive place invariants in 23 ms returned sat
[2020-06-04 02:51:14] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 5 ms returned sat
[2020-06-04 02:51:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:51:14] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2020-06-04 02:51:14] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:51:14] [INFO ] [Nat]Absence check using 5 positive place invariants in 14 ms returned sat
[2020-06-04 02:51:14] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 4 ms returned sat
[2020-06-04 02:51:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:51:14] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2020-06-04 02:51:14] [INFO ] Deduced a trap composed of 18 places in 76 ms
[2020-06-04 02:51:15] [INFO ] Deduced a trap composed of 42 places in 52 ms
[2020-06-04 02:51:15] [INFO ] Deduced a trap composed of 55 places in 35 ms
[2020-06-04 02:51:15] [INFO ] Deduced a trap composed of 56 places in 31 ms
[2020-06-04 02:51:15] [INFO ] Deduced a trap composed of 56 places in 47 ms
[2020-06-04 02:51:15] [INFO ] Deduced a trap composed of 56 places in 42 ms
[2020-06-04 02:51:15] [INFO ] Deduced a trap composed of 58 places in 32 ms
[2020-06-04 02:51:15] [INFO ] Deduced a trap composed of 44 places in 40 ms
[2020-06-04 02:51:15] [INFO ] Deduced a trap composed of 46 places in 38 ms
[2020-06-04 02:51:15] [INFO ] Deduced a trap composed of 56 places in 33 ms
[2020-06-04 02:51:15] [INFO ] Deduced a trap composed of 30 places in 29 ms
[2020-06-04 02:51:15] [INFO ] Deduced a trap composed of 63 places in 28 ms
[2020-06-04 02:51:15] [INFO ] Deduced a trap composed of 71 places in 28 ms
[2020-06-04 02:51:15] [INFO ] Deduced a trap composed of 58 places in 29 ms
[2020-06-04 02:51:15] [INFO ] Deduced a trap composed of 77 places in 27 ms
[2020-06-04 02:51:15] [INFO ] Deduced a trap composed of 54 places in 29 ms
[2020-06-04 02:51:15] [INFO ] Deduced a trap composed of 71 places in 33 ms
[2020-06-04 02:51:15] [INFO ] Deduced a trap composed of 60 places in 47 ms
[2020-06-04 02:51:15] [INFO ] Deduced a trap composed of 72 places in 50 ms
[2020-06-04 02:51:15] [INFO ] Deduced a trap composed of 45 places in 40 ms
[2020-06-04 02:51:15] [INFO ] Deduced a trap composed of 44 places in 34 ms
[2020-06-04 02:51:15] [INFO ] Deduced a trap composed of 68 places in 32 ms
[2020-06-04 02:51:15] [INFO ] Deduced a trap composed of 59 places in 29 ms
[2020-06-04 02:51:15] [INFO ] Deduced a trap composed of 60 places in 28 ms
[2020-06-04 02:51:16] [INFO ] Deduced a trap composed of 70 places in 28 ms
[2020-06-04 02:51:16] [INFO ] Deduced a trap composed of 57 places in 29 ms
[2020-06-04 02:51:16] [INFO ] Deduced a trap composed of 54 places in 28 ms
[2020-06-04 02:51:16] [INFO ] Deduced a trap composed of 69 places in 28 ms
[2020-06-04 02:51:16] [INFO ] Deduced a trap composed of 59 places in 28 ms
[2020-06-04 02:51:16] [INFO ] Deduced a trap composed of 60 places in 28 ms
[2020-06-04 02:51:16] [INFO ] Deduced a trap composed of 78 places in 27 ms
[2020-06-04 02:51:16] [INFO ] Deduced a trap composed of 72 places in 28 ms
[2020-06-04 02:51:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 32 trap constraints in 1351 ms
[2020-06-04 02:51:16] [INFO ] [Real]Absence check using 5 positive place invariants in 14 ms returned unsat
[2020-06-04 02:51:16] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2020-06-04 02:51:16] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 4 ms returned sat
[2020-06-04 02:51:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:51:16] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2020-06-04 02:51:16] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints in 6 ms.
[2020-06-04 02:51:16] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:51:16] [INFO ] [Nat]Absence check using 5 positive place invariants in 13 ms returned sat
[2020-06-04 02:51:16] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 4 ms returned sat
[2020-06-04 02:51:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:51:16] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2020-06-04 02:51:16] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints in 7 ms.
[2020-06-04 02:51:16] [INFO ] Added : 81 causal constraints over 17 iterations in 157 ms. Result :sat
[2020-06-04 02:51:16] [INFO ] [Real]Absence check using 5 positive place invariants in 11 ms returned unsat
[2020-06-04 02:51:16] [INFO ] [Real]Absence check using 5 positive place invariants in 14 ms returned unsat
[2020-06-04 02:51:16] [INFO ] [Real]Absence check using 5 positive place invariants in 6 ms returned unsat
[2020-06-04 02:51:16] [INFO ] [Real]Absence check using 5 positive place invariants in 8 ms returned sat
[2020-06-04 02:51:16] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 4 ms returned sat
[2020-06-04 02:51:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:51:16] [INFO ] [Real]Absence check using state equation in 83 ms returned sat
[2020-06-04 02:51:16] [INFO ] Deduced a trap composed of 18 places in 44 ms
[2020-06-04 02:51:16] [INFO ] Deduced a trap composed of 48 places in 41 ms
[2020-06-04 02:51:16] [INFO ] Deduced a trap composed of 38 places in 26 ms
[2020-06-04 02:51:16] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 129 ms
[2020-06-04 02:51:17] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:51:17] [INFO ] [Nat]Absence check using 5 positive place invariants in 12 ms returned sat
[2020-06-04 02:51:17] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 4 ms returned sat
[2020-06-04 02:51:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:51:17] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2020-06-04 02:51:17] [INFO ] Deduced a trap composed of 18 places in 69 ms
[2020-06-04 02:51:17] [INFO ] Deduced a trap composed of 38 places in 42 ms
[2020-06-04 02:51:17] [INFO ] Deduced a trap composed of 33 places in 35 ms
[2020-06-04 02:51:17] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 169 ms
[2020-06-04 02:51:17] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints in 9 ms.
[2020-06-04 02:51:17] [INFO ] Added : 95 causal constraints over 19 iterations in 179 ms. Result :sat
[2020-06-04 02:51:17] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned unsat
[2020-06-04 02:51:17] [INFO ] [Real]Absence check using 5 positive place invariants in 6 ms returned sat
[2020-06-04 02:51:17] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 5 ms returned sat
[2020-06-04 02:51:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:51:17] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2020-06-04 02:51:17] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:51:17] [INFO ] [Nat]Absence check using 5 positive place invariants in 12 ms returned sat
[2020-06-04 02:51:17] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 4 ms returned sat
[2020-06-04 02:51:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:51:17] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2020-06-04 02:51:17] [INFO ] Deduced a trap composed of 42 places in 67 ms
[2020-06-04 02:51:17] [INFO ] Deduced a trap composed of 43 places in 40 ms
[2020-06-04 02:51:17] [INFO ] Deduced a trap composed of 49 places in 36 ms
[2020-06-04 02:51:17] [INFO ] Deduced a trap composed of 39 places in 40 ms
[2020-06-04 02:51:17] [INFO ] Deduced a trap composed of 25 places in 44 ms
[2020-06-04 02:51:17] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 262 ms
[2020-06-04 02:51:17] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints in 7 ms.
[2020-06-04 02:51:18] [INFO ] Added : 95 causal constraints over 19 iterations in 196 ms. Result :sat
[2020-06-04 02:51:18] [INFO ] [Real]Absence check using 5 positive place invariants in 10 ms returned unsat
[2020-06-04 02:51:18] [INFO ] [Real]Absence check using 5 positive place invariants in 6 ms returned unsat
[2020-06-04 02:51:18] [INFO ] [Real]Absence check using 5 positive place invariants in 9 ms returned unsat
[2020-06-04 02:51:18] [INFO ] [Real]Absence check using 5 positive place invariants in 9 ms returned sat
[2020-06-04 02:51:18] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 5 ms returned sat
[2020-06-04 02:51:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:51:18] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2020-06-04 02:51:18] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:51:18] [INFO ] [Nat]Absence check using 5 positive place invariants in 20 ms returned unsat
[2020-06-04 02:51:18] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2020-06-04 02:51:18] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 4 ms returned sat
[2020-06-04 02:51:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:51:18] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2020-06-04 02:51:18] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:51:18] [INFO ] [Nat]Absence check using 5 positive place invariants in 19 ms returned sat
[2020-06-04 02:51:18] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 6 ms returned sat
[2020-06-04 02:51:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:51:18] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2020-06-04 02:51:18] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints in 7 ms.
[2020-06-04 02:51:18] [INFO ] Added : 96 causal constraints over 20 iterations in 198 ms. Result :sat
[2020-06-04 02:51:18] [INFO ] [Real]Absence check using 5 positive place invariants in 11 ms returned sat
[2020-06-04 02:51:18] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 7 ms returned sat
[2020-06-04 02:51:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:51:18] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2020-06-04 02:51:18] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:51:18] [INFO ] [Nat]Absence check using 5 positive place invariants in 18 ms returned sat
[2020-06-04 02:51:18] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 6 ms returned sat
[2020-06-04 02:51:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:51:18] [INFO ] [Nat]Absence check using state equation in 153 ms returned sat
[2020-06-04 02:51:19] [INFO ] Deduced a trap composed of 37 places in 23 ms
[2020-06-04 02:51:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
[2020-06-04 02:51:19] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints in 9 ms.
[2020-06-04 02:51:19] [INFO ] Added : 95 causal constraints over 19 iterations in 286 ms. Result :sat
[2020-06-04 02:51:19] [INFO ] Deduced a trap composed of 24 places in 30 ms
[2020-06-04 02:51:19] [INFO ] Deduced a trap composed of 35 places in 35 ms
[2020-06-04 02:51:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 121 ms
[2020-06-04 02:51:19] [INFO ] [Real]Absence check using 5 positive place invariants in 30 ms returned unsat
[2020-06-04 02:51:19] [INFO ] [Real]Absence check using 5 positive place invariants in 6 ms returned unsat
[2020-06-04 02:51:19] [INFO ] [Real]Absence check using 5 positive place invariants in 7 ms returned sat
[2020-06-04 02:51:19] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 5 ms returned sat
[2020-06-04 02:51:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:51:19] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2020-06-04 02:51:19] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:51:19] [INFO ] [Nat]Absence check using 5 positive place invariants in 21 ms returned sat
[2020-06-04 02:51:19] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 7 ms returned sat
[2020-06-04 02:51:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:51:19] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2020-06-04 02:51:19] [INFO ] Deduced a trap composed of 33 places in 134 ms
[2020-06-04 02:51:19] [INFO ] Deduced a trap composed of 36 places in 52 ms
[2020-06-04 02:51:20] [INFO ] Deduced a trap composed of 46 places in 70 ms
[2020-06-04 02:51:20] [INFO ] Deduced a trap composed of 30 places in 46 ms
[2020-06-04 02:51:20] [INFO ] Deduced a trap composed of 57 places in 75 ms
[2020-06-04 02:51:20] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 418 ms
[2020-06-04 02:51:20] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints in 4 ms.
[2020-06-04 02:51:20] [INFO ] Added : 95 causal constraints over 20 iterations in 309 ms. Result :sat
[2020-06-04 02:51:20] [INFO ] Deduced a trap composed of 45 places in 56 ms
[2020-06-04 02:51:20] [INFO ] Deduced a trap composed of 53 places in 42 ms
[2020-06-04 02:51:20] [INFO ] Deduced a trap composed of 54 places in 35 ms
[2020-06-04 02:51:20] [INFO ] Deduced a trap composed of 67 places in 52 ms
[2020-06-04 02:51:20] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 297 ms
[2020-06-04 02:51:20] [INFO ] [Real]Absence check using 5 positive place invariants in 8 ms returned sat
[2020-06-04 02:51:20] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 6 ms returned sat
[2020-06-04 02:51:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:51:20] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2020-06-04 02:51:20] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:51:20] [INFO ] [Nat]Absence check using 5 positive place invariants in 25 ms returned sat
[2020-06-04 02:51:20] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 4 ms returned sat
[2020-06-04 02:51:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:51:21] [INFO ] [Nat]Absence check using state equation in 127 ms returned sat
[2020-06-04 02:51:21] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints in 35 ms.
[2020-06-04 02:51:21] [INFO ] Added : 96 causal constraints over 20 iterations in 228 ms. Result :sat
[2020-06-04 02:51:21] [INFO ] [Real]Absence check using 5 positive place invariants in 7 ms returned sat
[2020-06-04 02:51:21] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 5 ms returned sat
[2020-06-04 02:51:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:51:21] [INFO ] [Real]Absence check using state equation in 42 ms returned unsat
[2020-06-04 02:51:21] [INFO ] [Real]Absence check using 5 positive place invariants in 6 ms returned sat
[2020-06-04 02:51:21] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 4 ms returned sat
[2020-06-04 02:51:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:51:21] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2020-06-04 02:51:21] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:51:21] [INFO ] [Nat]Absence check using 5 positive place invariants in 23 ms returned sat
[2020-06-04 02:51:21] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 4 ms returned sat
[2020-06-04 02:51:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:51:21] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2020-06-04 02:51:21] [INFO ] Deduced a trap composed of 31 places in 68 ms
[2020-06-04 02:51:21] [INFO ] Deduced a trap composed of 25 places in 47 ms
[2020-06-04 02:51:21] [INFO ] Deduced a trap composed of 29 places in 52 ms
[2020-06-04 02:51:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 3 trap constraints in 207 ms
Successfully simplified 17 atomic propositions for a total of 19 simplifications.
[2020-06-04 02:51:22] [INFO ] Initial state reduction rules for CTL removed 9 formulas.
[2020-06-04 02:51:22] [INFO ] Flatten gal took : 75 ms
[2020-06-04 02:51:22] [INFO ] Initial state reduction rules for CTL removed 9 formulas.
[2020-06-04 02:51:22] [INFO ] Flatten gal took : 19 ms
FORMULA DoubleExponent-PT-002-CTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-002-CTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-002-CTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-002-CTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-002-CTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-002-CTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-002-CTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-002-CTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-002-CTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-04 02:51:22] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLCardinality.sr.xml took 14 ms.
[2020-06-04 02:51:22] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 3 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLCardinality @ DoubleExponent-PT-002 @ 3570 seconds

FORMULA DoubleExponent-PT-002-CTLCardinality-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DoubleExponent-PT-002-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DoubleExponent-PT-002-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DoubleExponent-PT-002-CTLCardinality-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DoubleExponent-PT-002-CTLCardinality-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DoubleExponent-PT-002-CTLCardinality-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DoubleExponent-PT-002-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3567
rslt: Output for CTLCardinality @ 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=CTLCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--quickchecks",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ctl",
"--json=CTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Thu Jun 4 02:51:22 2020
",
"timelimit": 3570
},
"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": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "DEADLOCK",
"processed_size": 8,
"rewrites": 19
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"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": "AX(EG((p107 <= p85)))",
"processed_size": 21,
"rewrites": 21
},
"net":
{
"conflict_clusters": 75,
"singleton_clusters": 0
},
"result":
{
"edges": 23,
"markings": 24,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "E (F (((p43 <= p27) AND (1 <= p106) AND (p94 + 1 <= p1))))",
"processed_size": 58,
"rewrites": 20
},
"result":
{
"edges": 3467,
"markings": 3468,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"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": "(p14 <= 1)",
"processed_size": 10,
"rewrites": 23
},
"result":
{
"edges": 295,
"markings": 296,
"produced_by": "parallel",
"value": true
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "tscc preserving/always up"
}
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"store":
{
"type": "dfs/tscc"
},
"type": "possible_invariance",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1189
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 2,
"aneg": 1,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "(((p89 <= 0) OR (p6 + 1 <= p108)) AND ((p101 <= 0) OR ((p52 + 1 <= p68) AND (p70 + 1 <= p54))))",
"processed_size": 97,
"rewrites": 22
},
"result":
{
"edges": 22,
"markings": 23,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 21
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 6,
"problems": 3
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1783
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1783
},
"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": "(p13 <= 1)",
"processed_size": 10,
"rewrites": 19
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 5,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3567
},
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(p67 <= p68)",
"processed_size": 12,
"rewrites": 22
},
"result":
{
"edges": 22,
"markings": 23,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 6
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 5,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3567
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3567
},
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(p77 <= p96)",
"processed_size": 12,
"rewrites": 19
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 6,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 6,
"type": "boolean"
}
},

{
"child":
[

{
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(p77 <= p96)",
"processed_size": 12,
"rewrites": 19
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 7,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "((p6 <= p98) AND ((p15 <= 2) OR (p73 <= 0)))",
"processed_size": 45,
"rewrites": 22
},
"result":
{
"edges": 22,
"markings": 23,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 13
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 2
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 7,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 19876,
"runtime": 3.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E(F(A(G(**)))) : A(F(**)) : DEADLOCK : (** AND A(F(*))) : E(F(**)) : A(X(E(G(**)))) : (** AND A(F(**)))"
},
"net":
{
"arcs": 276,
"conflict_clusters": 75,
"places": 110,
"places_significant": 96,
"singleton_clusters": 0,
"transitions": 98
},
"result":
{
"preliminary_value": "yes no no no yes yes no ",
"value": "yes no no no yes 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: 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 CTLCardinality.xml
lola: LP says that atomic proposition is always false: (3 <= p104)
lola: E ((E (G ((0 <= 0))) U A (G ((2 <= p14))))) : A (F ((((1 <= p89) AND (p108 <= p6)) OR ((1 <= p101) AND ((p68 <= p52) OR (p54 <= p70)))))) : A (X ((1 <= 0))) : ((p13 <= 1) AND (E (X ((1 <= 0))) OR NOT(E (G ((p67 <= p68)))))) : E (((0 <= 0) U ((p43 <= p27) AND (1 <= p106) AND (p94 + 1 <= p1)))) : (A (X (E (G ((p107 <= p85))))) OR A (((1 <= 0) U (1 <= 0)))) : ((p77 <= p96) AND A (F (((p98 + 1 <= p6) OR ((3 <= p15) AND (1 <= p73))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:139
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:133
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:121
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: DEADLOCK
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: DEADLOCK
lola: processed formula length: 8
lola: 19 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 0 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 1 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (E (G ((p107 <= p85)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(EG((p107 <= p85)))
lola: processed formula length: 21
lola: 21 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 24 markings, 23 edges
lola: ========================================
lola: subprocess 2 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p43 <= p27) AND (1 <= p106) AND (p94 + 1 <= p1))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((p43 <= p27) AND (1 <= p106) AND (p94 + 1 <= p1))))
lola: processed formula length: 58
lola: 20 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 3468 markings, 3467 edges
lola: ========================================
lola: subprocess 3 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (G ((2 <= p14)))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:604
lola: rewrite Frontend/Parser/formula_rewrite.k:614
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p14 <= 1)
lola: processed formula length: 10
lola: 23 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (2 <= p14)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: parallel
lola: The predicate is possibly invariant.
lola: 296 markings, 295 edges
lola: ========================================
lola: subprocess 4 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((((1 <= p89) AND (p108 <= p6)) OR ((1 <= p101) AND ((p68 <= p52) OR (p54 <= p70))))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (((p89 <= 0) OR (p6 + 1 <= p108)) AND ((p101 <= 0) OR ((p52 + 1 <= p68) AND (p70 + 1 <= p54))))
lola: processed formula length: 97
lola: 22 rewrites
lola: closed formula file CTLCardinality.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: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: The predicate does not eventually occur.
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p89) AND (p108 <= p6)) OR ((1 <= p101) AND ((p68 <= p52) OR (p54 <= p70))))
lola: 23 markings, 22 edges
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 6 literals and 3 conjunctive subformulas
lola: ========================================
lola: subprocess 5 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p13 <= 1) AND A (F ((p68 + 1 <= p67))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p13 <= 1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p13 <= 1)
lola: processed formula length: 10
lola: 19 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 6 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((p68 + 1 <= p67)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: (p67 <= p68)
lola: processed formula length: 12
lola: 22 rewrites
lola: closed formula file CTLCardinality.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: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
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: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: lola: subprocess 6 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p77 <= p96) AND A (F (((p98 + 1 <= p6) OR ((3 <= p15) AND (1 <= p73))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p77 <= p96)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p77 <= p96)
lola: processed formula length: 12
lola: 19 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
state equation task get result unparse finished++ id 0
lola: formula 0: (p68 + 1 <= p67)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: ========================================
lola: lola: ========================================
...considering subproblem: ((p77 <= p96) AND A (F (((p98 + 1 <= p6) OR ((3 <= p15) AND (1 <= p73))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (p77 <= p96)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p77 <= p96)
lola: processed formula length: 12
lola: 19 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (F (((p98 + 1 <= p6) OR ((3 <= p15) AND (1 <= p73)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p6 <= p98) AND ((p15 <= 2) OR (p73 <= 0)))
lola: processed formula length: 45
lola: 22 rewrites
lola: closed formula file CTLCardinality.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: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p98 + 1 <= p6) OR ((3 <= p15) AND (1 <= p73)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 2 conjunctive subformulas
lola: The predicate does not eventually occur.
lola: 23 markings, 22 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no no no yes yes no
lola:
preliminary result: yes no no no yes yes no
lola: memory consumption: 19876 KB
lola: time consumption: 3 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLCardinality.json
lola: closed JSON file CTLCardinality.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="CTLCardinality"
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 CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r178-tajo-158987882800755"
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 [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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