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

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

=== Now, execution of the tool begins

BK_START 1591239081029

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 02:51:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-04 02:51:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 02:51:23] [INFO ] Load time of PNML (sax parser for PT used): 38 ms
[2020-06-04 02:51:23] [INFO ] Transformed 110 places.
[2020-06-04 02:51:23] [INFO ] Transformed 98 transitions.
[2020-06-04 02:51:23] [INFO ] Parsed PT model containing 110 places and 98 transitions in 71 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 21 ms.
Incomplete random walk after 100000 steps, including 3315 resets, run finished after 239 ms. (steps per millisecond=418 ) properties seen :[0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 98 rows 110 cols
[2020-06-04 02:51:23] [INFO ] Computed 14 place invariants in 8 ms
[2020-06-04 02:51:23] [INFO ] [Real]Absence check using 5 positive place invariants in 26 ms returned sat
[2020-06-04 02:51:23] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 10 ms returned sat
[2020-06-04 02:51:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:51:23] [INFO ] [Real]Absence check using state equation in 90 ms returned sat
[2020-06-04 02:51:23] [INFO ] Deduced a trap composed of 33 places in 116 ms
[2020-06-04 02:51:23] [INFO ] Deduced a trap composed of 45 places in 38 ms
[2020-06-04 02:51:24] [INFO ] Deduced a trap composed of 70 places in 172 ms
[2020-06-04 02:51:24] [INFO ] Deduced a trap composed of 44 places in 115 ms
[2020-06-04 02:51:24] [INFO ] Deduced a trap composed of 30 places in 55 ms
[2020-06-04 02:51:24] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 575 ms
[2020-06-04 02:51:24] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:51:24] [INFO ] [Nat]Absence check using 5 positive place invariants in 28 ms returned sat
[2020-06-04 02:51:24] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 7 ms returned sat
[2020-06-04 02:51:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:51:24] [INFO ] [Nat]Absence check using state equation in 90 ms returned sat
[2020-06-04 02:51:24] [INFO ] Deduced a trap composed of 45 places in 63 ms
[2020-06-04 02:51:24] [INFO ] Deduced a trap composed of 70 places in 45 ms
[2020-06-04 02:51:24] [INFO ] Deduced a trap composed of 44 places in 46 ms
[2020-06-04 02:51:24] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 191 ms
[2020-06-04 02:51:24] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints in 26 ms.
[2020-06-04 02:51:24] [INFO ] Added : 95 causal constraints over 19 iterations in 180 ms. Result :sat
[2020-06-04 02:51:24] [INFO ] [Real]Absence check using 5 positive place invariants in 7 ms returned sat
[2020-06-04 02:51:24] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 4 ms returned sat
[2020-06-04 02:51:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:51:24] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2020-06-04 02:51:24] [INFO ] Deduced a trap composed of 18 places in 45 ms
[2020-06-04 02:51:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 56 ms
[2020-06-04 02:51:25] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:51:25] [INFO ] [Nat]Absence check using 5 positive place invariants in 11 ms returned sat
[2020-06-04 02:51:25] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 4 ms returned sat
[2020-06-04 02:51:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:51:25] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2020-06-04 02:51:25] [INFO ] Deduced a trap composed of 18 places in 42 ms
[2020-06-04 02:51:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
[2020-06-04 02:51:25] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints in 7 ms.
[2020-06-04 02:51:25] [INFO ] Added : 94 causal constraints over 19 iterations in 162 ms. Result :sat
[2020-06-04 02:51:25] [INFO ] Deduced a trap composed of 46 places in 36 ms
[2020-06-04 02:51:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
[2020-06-04 02:51:25] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2020-06-04 02:51:25] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 4 ms returned sat
[2020-06-04 02:51:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:51:25] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2020-06-04 02:51:25] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints in 12 ms.
[2020-06-04 02:51:25] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:51:25] [INFO ] [Nat]Absence check using 5 positive place invariants in 43 ms returned sat
[2020-06-04 02:51:25] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 32 ms returned sat
[2020-06-04 02:51:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:51:25] [INFO ] [Nat]Absence check using state equation in 126 ms returned sat
[2020-06-04 02:51:25] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints in 5 ms.
[2020-06-04 02:51:25] [INFO ] Added : 94 causal constraints over 19 iterations in 197 ms. Result :sat
[2020-06-04 02:51:26] [INFO ] [Real]Absence check using 5 positive place invariants in 6 ms returned sat
[2020-06-04 02:51:26] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 3 ms returned sat
[2020-06-04 02:51:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:51:26] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2020-06-04 02:51:26] [INFO ] Deduced a trap composed of 18 places in 49 ms
[2020-06-04 02:51:26] [INFO ] Deduced a trap composed of 37 places in 18 ms
[2020-06-04 02:51:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 90 ms
[2020-06-04 02:51:26] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:51:26] [INFO ] [Nat]Absence check using 5 positive place invariants in 11 ms returned sat
[2020-06-04 02:51:26] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 4 ms returned sat
[2020-06-04 02:51:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:51:26] [INFO ] [Nat]Absence check using state equation in 372 ms returned sat
[2020-06-04 02:51:26] [INFO ] Deduced a trap composed of 18 places in 311 ms
[2020-06-04 02:51:26] [INFO ] Deduced a trap composed of 37 places in 18 ms
[2020-06-04 02:51:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 354 ms
[2020-06-04 02:51:26] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints in 7 ms.
[2020-06-04 02:51:27] [INFO ] Added : 95 causal constraints over 19 iterations in 152 ms. Result :sat
[2020-06-04 02:51:27] [INFO ] [Real]Absence check using 5 positive place invariants in 14 ms returned sat
[2020-06-04 02:51:27] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 5 ms returned sat
[2020-06-04 02:51:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:51:27] [INFO ] [Real]Absence check using state equation in 100 ms returned sat
[2020-06-04 02:51:27] [INFO ] Deduced a trap composed of 30 places in 32 ms
[2020-06-04 02:51:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
[2020-06-04 02:51:27] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:51:27] [INFO ] [Nat]Absence check using 5 positive place invariants in 17 ms returned sat
[2020-06-04 02:51:27] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 8 ms returned sat
[2020-06-04 02:51:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:51:27] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2020-06-04 02:51:27] [INFO ] Deduced a trap composed of 30 places in 37 ms
[2020-06-04 02:51:27] [INFO ] Deduced a trap composed of 18 places in 52 ms
[2020-06-04 02:51:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 104 ms
[2020-06-04 02:51:27] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints in 6 ms.
[2020-06-04 02:51:27] [INFO ] Added : 95 causal constraints over 19 iterations in 139 ms. Result :sat
[2020-06-04 02:51:27] [INFO ] [Real]Absence check using 5 positive place invariants in 11 ms returned sat
[2020-06-04 02:51:27] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 4 ms returned sat
[2020-06-04 02:51:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:51:27] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2020-06-04 02:51:27] [INFO ] Deduced a trap composed of 33 places in 130 ms
[2020-06-04 02:51:27] [INFO ] Deduced a trap composed of 45 places in 50 ms
[2020-06-04 02:51:28] [INFO ] Deduced a trap composed of 30 places in 74 ms
[2020-06-04 02:51:28] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 280 ms
[2020-06-04 02:51:28] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:51:28] [INFO ] [Nat]Absence check using 5 positive place invariants in 26 ms returned sat
[2020-06-04 02:51:28] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 7 ms returned sat
[2020-06-04 02:51:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:51:28] [INFO ] [Nat]Absence check using state equation in 94 ms returned sat
[2020-06-04 02:51:28] [INFO ] Deduced a trap composed of 44 places in 31 ms
[2020-06-04 02:51:28] [INFO ] Deduced a trap composed of 18 places in 36 ms
[2020-06-04 02:51:28] [INFO ] Deduced a trap composed of 30 places in 22 ms
[2020-06-04 02:51:28] [INFO ] Deduced a trap composed of 53 places in 39 ms
[2020-06-04 02:51:28] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 186 ms
[2020-06-04 02:51:28] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints in 7 ms.
[2020-06-04 02:51:28] [INFO ] Added : 89 causal constraints over 18 iterations in 199 ms. Result :sat
[2020-06-04 02:51:28] [INFO ] [Real]Absence check using 5 positive place invariants in 8 ms returned sat
[2020-06-04 02:51:28] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 5 ms returned sat
[2020-06-04 02:51:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:51:28] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2020-06-04 02:51:28] [INFO ] Deduced a trap composed of 18 places in 42 ms
[2020-06-04 02:51:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 56 ms
[2020-06-04 02:51:28] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:51:28] [INFO ] [Nat]Absence check using 5 positive place invariants in 33 ms returned sat
[2020-06-04 02:51:28] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 6 ms returned sat
[2020-06-04 02:51:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:51:28] [INFO ] [Nat]Absence check using state equation in 104 ms returned sat
[2020-06-04 02:51:28] [INFO ] Deduced a trap composed of 18 places in 33 ms
[2020-06-04 02:51:29] [INFO ] Deduced a trap composed of 25 places in 46 ms
[2020-06-04 02:51:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 103 ms
[2020-06-04 02:51:29] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints in 8 ms.
[2020-06-04 02:51:29] [INFO ] Added : 58 causal constraints over 12 iterations in 122 ms. Result :sat
[2020-06-04 02:51:29] [INFO ] [Real]Absence check using 5 positive place invariants in 6 ms returned sat
[2020-06-04 02:51:29] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 5 ms returned sat
[2020-06-04 02:51:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:51:29] [INFO ] [Real]Absence check using state equation in 89 ms returned sat
[2020-06-04 02:51:29] [INFO ] Deduced a trap composed of 39 places in 42 ms
[2020-06-04 02:51:29] [INFO ] Deduced a trap composed of 25 places in 54 ms
[2020-06-04 02:51:29] [INFO ] Deduced a trap composed of 50 places in 56 ms
[2020-06-04 02:51:29] [INFO ] Deduced a trap composed of 61 places in 53 ms
[2020-06-04 02:51:29] [INFO ] Deduced a trap composed of 52 places in 47 ms
[2020-06-04 02:51:29] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 315 ms
[2020-06-04 02:51:29] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:51:29] [INFO ] [Nat]Absence check using 5 positive place invariants in 34 ms returned sat
[2020-06-04 02:51:29] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 6 ms returned sat
[2020-06-04 02:51:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:51:30] [INFO ] [Nat]Absence check using state equation in 672 ms returned sat
[2020-06-04 02:51:30] [INFO ] Deduced a trap composed of 39 places in 116 ms
[2020-06-04 02:51:30] [INFO ] Deduced a trap composed of 25 places in 60 ms
[2020-06-04 02:51:30] [INFO ] Deduced a trap composed of 42 places in 49 ms
[2020-06-04 02:51:30] [INFO ] Deduced a trap composed of 46 places in 43 ms
[2020-06-04 02:51:30] [INFO ] Deduced a trap composed of 47 places in 83 ms
[2020-06-04 02:51:30] [INFO ] Deduced a trap composed of 30 places in 111 ms
[2020-06-04 02:51:30] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 538 ms
[2020-06-04 02:51:30] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints in 7 ms.
[2020-06-04 02:51:31] [INFO ] Added : 95 causal constraints over 19 iterations in 201 ms. Result :sat
[2020-06-04 02:51:31] [INFO ] Deduced a trap composed of 44 places in 56 ms
[2020-06-04 02:51:31] [INFO ] Deduced a trap composed of 46 places in 67 ms
[2020-06-04 02:51:32] [INFO ] Deduced a trap composed of 47 places in 1252 ms
[2020-06-04 02:51:32] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1427 ms
[2020-06-04 02:51:32] [INFO ] [Real]Absence check using 5 positive place invariants in 53 ms returned sat
[2020-06-04 02:51:32] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 79 ms returned sat
[2020-06-04 02:51:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:51:33] [INFO ] [Real]Absence check using state equation in 394 ms returned sat
[2020-06-04 02:51:33] [INFO ] Deduced a trap composed of 18 places in 38 ms
[2020-06-04 02:51:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2020-06-04 02:51:33] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:51:33] [INFO ] [Nat]Absence check using 5 positive place invariants in 16 ms returned sat
[2020-06-04 02:51:33] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 4 ms returned sat
[2020-06-04 02:51:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:51:33] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2020-06-04 02:51:33] [INFO ] Deduced a trap composed of 18 places in 377 ms
[2020-06-04 02:51:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 401 ms
[2020-06-04 02:51:33] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints in 8 ms.
[2020-06-04 02:51:33] [INFO ] Added : 95 causal constraints over 19 iterations in 210 ms. Result :sat
[2020-06-04 02:51:33] [INFO ] [Real]Absence check using 5 positive place invariants in 7 ms returned sat
[2020-06-04 02:51:33] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 5 ms returned sat
[2020-06-04 02:51:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:51:33] [INFO ] [Real]Absence check using state equation in 76 ms returned sat
[2020-06-04 02:51:34] [INFO ] Deduced a trap composed of 45 places in 216 ms
[2020-06-04 02:51:34] [INFO ] Deduced a trap composed of 70 places in 32 ms
[2020-06-04 02:51:34] [INFO ] Deduced a trap composed of 44 places in 181 ms
[2020-06-04 02:51:34] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 495 ms
[2020-06-04 02:51:34] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:51:34] [INFO ] [Nat]Absence check using 5 positive place invariants in 10 ms returned sat
[2020-06-04 02:51:34] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 3 ms returned sat
[2020-06-04 02:51:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:51:34] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2020-06-04 02:51:34] [INFO ] Deduced a trap composed of 45 places in 29 ms
[2020-06-04 02:51:34] [INFO ] Deduced a trap composed of 70 places in 28 ms
[2020-06-04 02:51:34] [INFO ] Deduced a trap composed of 44 places in 27 ms
[2020-06-04 02:51:34] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 99 ms
[2020-06-04 02:51:34] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints in 5 ms.
[2020-06-04 02:51:34] [INFO ] Added : 95 causal constraints over 19 iterations in 187 ms. Result :sat
[2020-06-04 02:51:34] [INFO ] Deduced a trap composed of 39 places in 35 ms
[2020-06-04 02:51:34] [INFO ] Deduced a trap composed of 25 places in 33 ms
[2020-06-04 02:51:34] [INFO ] Deduced a trap composed of 53 places in 34 ms
[2020-06-04 02:51:34] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 135 ms
[2020-06-04 02:51:34] [INFO ] [Real]Absence check using 5 positive place invariants in 8 ms returned sat
[2020-06-04 02:51:34] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 4 ms returned sat
[2020-06-04 02:51:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:51:35] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2020-06-04 02:51:35] [INFO ] Deduced a trap composed of 30 places in 34 ms
[2020-06-04 02:51:35] [INFO ] Deduced a trap composed of 18 places in 26 ms
[2020-06-04 02:51:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 73 ms
[2020-06-04 02:51:35] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:51:35] [INFO ] [Nat]Absence check using 5 positive place invariants in 12 ms returned sat
[2020-06-04 02:51:35] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 4 ms returned sat
[2020-06-04 02:51:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:51:35] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2020-06-04 02:51:35] [INFO ] Deduced a trap composed of 30 places in 61 ms
[2020-06-04 02:51:35] [INFO ] Deduced a trap composed of 18 places in 34 ms
[2020-06-04 02:51:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 109 ms
[2020-06-04 02:51:35] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints in 6 ms.
[2020-06-04 02:51:35] [INFO ] Added : 93 causal constraints over 19 iterations in 125 ms. Result :sat
[2020-06-04 02:51:35] [INFO ] [Real]Absence check using 5 positive place invariants in 7 ms returned sat
[2020-06-04 02:51:35] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 3 ms returned sat
[2020-06-04 02:51:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:51:35] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2020-06-04 02:51:35] [INFO ] Deduced a trap composed of 18 places in 19 ms
[2020-06-04 02:51:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 24 ms
[2020-06-04 02:51:35] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:51:35] [INFO ] [Nat]Absence check using 5 positive place invariants in 11 ms returned sat
[2020-06-04 02:51:35] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 7 ms returned sat
[2020-06-04 02:51:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:51:35] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2020-06-04 02:51:35] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints in 5 ms.
[2020-06-04 02:51:35] [INFO ] Added : 94 causal constraints over 19 iterations in 145 ms. Result :sat
[2020-06-04 02:51:35] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2020-06-04 02:51:35] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 3 ms returned sat
[2020-06-04 02:51:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:51:35] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2020-06-04 02:51:35] [INFO ] Deduced a trap composed of 18 places in 23 ms
[2020-06-04 02:51:35] [INFO ] Deduced a trap composed of 36 places in 22 ms
[2020-06-04 02:51:35] [INFO ] Deduced a trap composed of 34 places in 22 ms
[2020-06-04 02:51:35] [INFO ] Deduced a trap composed of 44 places in 26 ms
[2020-06-04 02:51:35] [INFO ] Deduced a trap composed of 30 places in 17 ms
[2020-06-04 02:51:35] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 145 ms
[2020-06-04 02:51:35] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:51:36] [INFO ] [Nat]Absence check using 5 positive place invariants in 12 ms returned sat
[2020-06-04 02:51:36] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 3 ms returned sat
[2020-06-04 02:51:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:51:36] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2020-06-04 02:51:36] [INFO ] Deduced a trap composed of 18 places in 27 ms
[2020-06-04 02:51:36] [INFO ] Deduced a trap composed of 36 places in 22 ms
[2020-06-04 02:51:36] [INFO ] Deduced a trap composed of 34 places in 23 ms
[2020-06-04 02:51:36] [INFO ] Deduced a trap composed of 44 places in 27 ms
[2020-06-04 02:51:36] [INFO ] Deduced a trap composed of 30 places in 21 ms
[2020-06-04 02:51:36] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 149 ms
[2020-06-04 02:51:36] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints in 5 ms.
[2020-06-04 02:51:36] [INFO ] Added : 95 causal constraints over 19 iterations in 159 ms. Result :sat
[2020-06-04 02:51:36] [INFO ] Deduced a trap composed of 45 places in 30 ms
[2020-06-04 02:51:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
[2020-06-04 02:51:36] [INFO ] [Real]Absence check using 5 positive place invariants in 10 ms returned unsat
[2020-06-04 02:51:36] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned unsat
[2020-06-04 02:51:36] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2020-06-04 02:51:36] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 3 ms returned sat
[2020-06-04 02:51:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:51:36] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2020-06-04 02:51:36] [INFO ] Deduced a trap composed of 18 places in 29 ms
[2020-06-04 02:51:36] [INFO ] Deduced a trap composed of 30 places in 26 ms
[2020-06-04 02:51:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 66 ms
[2020-06-04 02:51:36] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:51:36] [INFO ] [Nat]Absence check using 5 positive place invariants in 12 ms returned sat
[2020-06-04 02:51:36] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 4 ms returned sat
[2020-06-04 02:51:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:51:36] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2020-06-04 02:51:36] [INFO ] Deduced a trap composed of 18 places in 26 ms
[2020-06-04 02:51:36] [INFO ] Deduced a trap composed of 30 places in 41 ms
[2020-06-04 02:51:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 80 ms
[2020-06-04 02:51:36] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints in 5 ms.
[2020-06-04 02:51:36] [INFO ] Added : 81 causal constraints over 17 iterations in 115 ms. Result :sat
[2020-06-04 02:51:36] [INFO ] [Real]Absence check using 5 positive place invariants in 6 ms returned sat
[2020-06-04 02:51:36] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 4 ms returned sat
[2020-06-04 02:51:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:51:36] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2020-06-04 02:51:37] [INFO ] Deduced a trap composed of 18 places in 51 ms
[2020-06-04 02:51:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 58 ms
[2020-06-04 02:51:37] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:51:37] [INFO ] [Nat]Absence check using 5 positive place invariants in 15 ms returned sat
[2020-06-04 02:51:37] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 3 ms returned sat
[2020-06-04 02:51:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:51:37] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2020-06-04 02:51:37] [INFO ] Deduced a trap composed of 30 places in 31 ms
[2020-06-04 02:51:37] [INFO ] Deduced a trap composed of 18 places in 27 ms
[2020-06-04 02:51:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 69 ms
[2020-06-04 02:51:37] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints in 5 ms.
[2020-06-04 02:51:37] [INFO ] Added : 93 causal constraints over 19 iterations in 144 ms. Result :sat
[2020-06-04 02:51:37] [INFO ] [Real]Absence check using 5 positive place invariants in 6 ms returned sat
[2020-06-04 02:51:37] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 4 ms returned sat
[2020-06-04 02:51:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:51:37] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2020-06-04 02:51:37] [INFO ] Deduced a trap composed of 18 places in 21 ms
[2020-06-04 02:51:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 28 ms
[2020-06-04 02:51:37] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:51:37] [INFO ] [Nat]Absence check using 5 positive place invariants in 11 ms returned sat
[2020-06-04 02:51:37] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 3 ms returned sat
[2020-06-04 02:51:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:51:37] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2020-06-04 02:51:37] [INFO ] Deduced a trap composed of 18 places in 20 ms
[2020-06-04 02:51:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 31 ms
[2020-06-04 02:51:37] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints in 4 ms.
[2020-06-04 02:51:37] [INFO ] Added : 93 causal constraints over 19 iterations in 131 ms. Result :sat
[2020-06-04 02:51:37] [INFO ] [Real]Absence check using 5 positive place invariants in 22 ms returned sat
[2020-06-04 02:51:37] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 7 ms returned sat
[2020-06-04 02:51:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:51:37] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2020-06-04 02:51:37] [INFO ] Deduced a trap composed of 18 places in 25 ms
[2020-06-04 02:51:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 31 ms
[2020-06-04 02:51:37] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:51:37] [INFO ] [Nat]Absence check using 5 positive place invariants in 11 ms returned sat
[2020-06-04 02:51:37] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 4 ms returned sat
[2020-06-04 02:51:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:51:37] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2020-06-04 02:51:37] [INFO ] Deduced a trap composed of 18 places in 36 ms
[2020-06-04 02:51:37] [INFO ] Deduced a trap composed of 25 places in 23 ms
[2020-06-04 02:51:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 73 ms
[2020-06-04 02:51:37] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints in 5 ms.
[2020-06-04 02:51:38] [INFO ] Added : 58 causal constraints over 12 iterations in 94 ms. Result :sat
[2020-06-04 02:51:38] [INFO ] [Real]Absence check using 5 positive place invariants in 6 ms returned unsat
[2020-06-04 02:51:38] [INFO ] [Real]Absence check using 5 positive place invariants in 6 ms returned sat
[2020-06-04 02:51:38] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 5 ms returned sat
[2020-06-04 02:51:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:51:38] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2020-06-04 02:51:38] [INFO ] Deduced a trap composed of 33 places in 26 ms
[2020-06-04 02:51:38] [INFO ] Deduced a trap composed of 45 places in 28 ms
[2020-06-04 02:51:38] [INFO ] Deduced a trap composed of 70 places in 24 ms
[2020-06-04 02:51:38] [INFO ] Deduced a trap composed of 44 places in 27 ms
[2020-06-04 02:51:38] [INFO ] Deduced a trap composed of 30 places in 15 ms
[2020-06-04 02:51:38] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 143 ms
[2020-06-04 02:51:38] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:51:38] [INFO ] [Nat]Absence check using 5 positive place invariants in 14 ms returned sat
[2020-06-04 02:51:38] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 4 ms returned sat
[2020-06-04 02:51:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:51:38] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2020-06-04 02:51:38] [INFO ] Deduced a trap composed of 33 places in 38 ms
[2020-06-04 02:51:38] [INFO ] Deduced a trap composed of 45 places in 26 ms
[2020-06-04 02:51:38] [INFO ] Deduced a trap composed of 70 places in 30 ms
[2020-06-04 02:51:38] [INFO ] Deduced a trap composed of 44 places in 30 ms
[2020-06-04 02:51:38] [INFO ] Deduced a trap composed of 30 places in 17 ms
[2020-06-04 02:51:38] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 166 ms
[2020-06-04 02:51:38] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints in 6 ms.
[2020-06-04 02:51:38] [INFO ] Added : 95 causal constraints over 19 iterations in 149 ms. Result :sat
[2020-06-04 02:51:38] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2020-06-04 02:51:38] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 3 ms returned sat
[2020-06-04 02:51:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:51:38] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2020-06-04 02:51:38] [INFO ] Deduced a trap composed of 18 places in 30 ms
[2020-06-04 02:51:38] [INFO ] Deduced a trap composed of 44 places in 31 ms
[2020-06-04 02:51:39] [INFO ] Deduced a trap composed of 38 places in 122 ms
[2020-06-04 02:51:39] [INFO ] Deduced a trap composed of 30 places in 47 ms
[2020-06-04 02:51:39] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 273 ms
[2020-06-04 02:51:39] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:51:39] [INFO ] [Nat]Absence check using 5 positive place invariants in 10 ms returned sat
[2020-06-04 02:51:39] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 3 ms returned sat
[2020-06-04 02:51:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:51:39] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2020-06-04 02:51:39] [INFO ] Deduced a trap composed of 18 places in 45 ms
[2020-06-04 02:51:39] [INFO ] Deduced a trap composed of 44 places in 34 ms
[2020-06-04 02:51:39] [INFO ] Deduced a trap composed of 38 places in 30 ms
[2020-06-04 02:51:39] [INFO ] Deduced a trap composed of 30 places in 30 ms
[2020-06-04 02:51:39] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 181 ms
[2020-06-04 02:51:39] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints in 10 ms.
[2020-06-04 02:51:39] [INFO ] Added : 72 causal constraints over 15 iterations in 114 ms. Result :sat
[2020-06-04 02:51:39] [INFO ] [Real]Absence check using 5 positive place invariants in 6 ms returned sat
[2020-06-04 02:51:39] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 4 ms returned sat
[2020-06-04 02:51:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:51:39] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2020-06-04 02:51:39] [INFO ] Deduced a trap composed of 18 places in 94 ms
[2020-06-04 02:51:39] [INFO ] Deduced a trap composed of 45 places in 66 ms
[2020-06-04 02:51:39] [INFO ] Deduced a trap composed of 70 places in 32 ms
[2020-06-04 02:51:39] [INFO ] Deduced a trap composed of 44 places in 27 ms
[2020-06-04 02:51:39] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 244 ms
[2020-06-04 02:51:39] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:51:39] [INFO ] [Nat]Absence check using 5 positive place invariants in 23 ms returned sat
[2020-06-04 02:51:39] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 3 ms returned sat
[2020-06-04 02:51:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:51:39] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2020-06-04 02:51:39] [INFO ] Deduced a trap composed of 18 places in 47 ms
[2020-06-04 02:51:39] [INFO ] Deduced a trap composed of 33 places in 32 ms
[2020-06-04 02:51:40] [INFO ] Deduced a trap composed of 45 places in 37 ms
[2020-06-04 02:51:40] [INFO ] Deduced a trap composed of 70 places in 33 ms
[2020-06-04 02:51:40] [INFO ] Deduced a trap composed of 44 places in 43 ms
[2020-06-04 02:51:40] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 242 ms
[2020-06-04 02:51:40] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints in 6 ms.
[2020-06-04 02:51:40] [INFO ] Added : 95 causal constraints over 19 iterations in 171 ms. Result :sat
[2020-06-04 02:51:40] [INFO ] [Real]Absence check using 5 positive place invariants in 11 ms returned sat
[2020-06-04 02:51:40] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 8 ms returned sat
[2020-06-04 02:51:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:51:40] [INFO ] [Real]Absence check using state equation in 104 ms returned sat
[2020-06-04 02:51:40] [INFO ] Deduced a trap composed of 18 places in 42 ms
[2020-06-04 02:51:40] [INFO ] Deduced a trap composed of 43 places in 35 ms
[2020-06-04 02:51:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 92 ms
[2020-06-04 02:51:40] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:51:40] [INFO ] [Nat]Absence check using 5 positive place invariants in 24 ms returned sat
[2020-06-04 02:51:40] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 79 ms returned sat
[2020-06-04 02:51:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:51:41] [INFO ] [Nat]Absence check using state equation in 704 ms returned sat
[2020-06-04 02:51:41] [INFO ] Deduced a trap composed of 18 places in 57 ms
[2020-06-04 02:51:41] [INFO ] Deduced a trap composed of 43 places in 43 ms
[2020-06-04 02:51:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 126 ms
[2020-06-04 02:51:41] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints in 6 ms.
[2020-06-04 02:51:41] [INFO ] Added : 85 causal constraints over 17 iterations in 116 ms. Result :sat
[2020-06-04 02:51:41] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned unsat
[2020-06-04 02:51:41] [INFO ] [Real]Absence check using 5 positive place invariants in 6 ms returned unsat
[2020-06-04 02:51:41] [INFO ] [Real]Absence check using 5 positive place invariants in 39 ms returned unsat
[2020-06-04 02:51:41] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2020-06-04 02:51:41] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 3 ms returned sat
[2020-06-04 02:51:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:51:41] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2020-06-04 02:51:41] [INFO ] Deduced a trap composed of 30 places in 23 ms
[2020-06-04 02:51:41] [INFO ] Deduced a trap composed of 18 places in 36 ms
[2020-06-04 02:51:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 83 ms
[2020-06-04 02:51:41] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:51:41] [INFO ] [Nat]Absence check using 5 positive place invariants in 14 ms returned sat
[2020-06-04 02:51:41] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 4 ms returned sat
[2020-06-04 02:51:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:51:42] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2020-06-04 02:51:42] [INFO ] Deduced a trap composed of 30 places in 26 ms
[2020-06-04 02:51:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
[2020-06-04 02:51:42] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints in 7 ms.
[2020-06-04 02:51:42] [INFO ] Added : 93 causal constraints over 19 iterations in 143 ms. Result :sat
Successfully simplified 6 atomic propositions for a total of 6 simplifications.
[2020-06-04 02:51:42] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2020-06-04 02:51:42] [INFO ] Flatten gal took : 65 ms
[2020-06-04 02:51:42] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2020-06-04 02:51:42] [INFO ] Flatten gal took : 10 ms
FORMULA DoubleExponent-PT-002-CTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-002-CTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-04 02:51:42] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLFireability.sr.xml took 9 ms.
[2020-06-04 02:51:42] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 3 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ DoubleExponent-PT-002 @ 3570 seconds

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

FORMULA DoubleExponent-PT-002-CTLFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA DoubleExponent-PT-002-CTLFireability-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DoubleExponent-PT-002-CTLFireability-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA DoubleExponent-PT-002-CTLFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DoubleExponent-PT-002-CTLFireability-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA DoubleExponent-PT-002-CTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DoubleExponent-PT-002-CTLFireability-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DoubleExponent-PT-002-CTLFireability-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DoubleExponent-PT-002-CTLFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DoubleExponent-PT-002-CTLFireability-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3566
rslt: Output for CTLFireability @ 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=CTLFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--quickchecks",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ctl",
"--json=CTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Thu Jun 4 02:51:42 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"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": "NOT DEADLOCK",
"processed_size": 12,
"rewrites": 20
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"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": "TRUE",
"processed_size": 4,
"rewrites": 20
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 1,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 2,
"E": 3,
"F": 1,
"G": 1,
"U": 1,
"X": 2,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "E((AX((1 <= p5)) OR EF(((1 <= p61) AND (1 <= p96)))) U (AG((1 <= p2)) AND EX(((1 <= p9) AND (1 <= p105)))))",
"processed_size": 107,
"rewrites": 25
},
"net":
{
"conflict_clusters": 75,
"singleton_clusters": 0
},
"result":
{
"edges": 5680,
"markings": 3708,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"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": 2,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "AF((EX((p87 <= 0)) AND (1 <= p95)))",
"processed_size": 35,
"rewrites": 22
},
"net":
{
"conflict_clusters": 75,
"singleton_clusters": 0
},
"result":
{
"edges": 24,
"markings": 25,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 2,
"E": 1,
"F": 1,
"G": 0,
"U": 1,
"X": 1,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "E((AX((1 <= p2)) OR (1 <= p20)) U (AF((1 <= p104)) AND ((p64 <= 0) OR (p100 <= 0))))",
"processed_size": 85,
"rewrites": 23
},
"net":
{
"conflict_clusters": 75,
"singleton_clusters": 0
},
"result":
{
"edges": 25,
"markings": 25,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 4,
"E": 1,
"F": 2,
"G": 1,
"U": 1,
"X": 1,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 5,
"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": "(AG(AF(((p27 <= 0) OR (p54 <= 0)))) OR A(AF(((1 <= p3) AND (1 <= p67))) U EX((1 <= p52))))",
"processed_size": 91,
"rewrites": 25
},
"net":
{
"conflict_clusters": 75,
"singleton_clusters": 0
},
"result":
{
"edges": 7416,
"markings": 3708,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 2,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "AF(EG(EX(((1 <= p79) AND (1 <= p98)))))",
"processed_size": 39,
"rewrites": 23
},
"net":
{
"conflict_clusters": 75,
"singleton_clusters": 0
},
"result":
{
"edges": 49,
"markings": 25,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "((p8 <= 0) OR (p47 <= 0))",
"processed_size": 26,
"rewrites": 23
},
"result":
{
"edges": 22,
"markings": 23,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 5
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "EG(AF(((1 <= p45) AND (1 <= p88))))",
"processed_size": 35,
"rewrites": 22
},
"net":
{
"conflict_clusters": 75,
"singleton_clusters": 0
},
"result":
{
"edges": 25,
"markings": 25,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 8,
"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": 1,
"E": 1,
"F": 1,
"G": 0,
"U": 1,
"X": 0,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 5,
"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": "A(((1 <= p22) OR EF(((1 <= p61) AND (1 <= p68)))) U ((1 <= p27) AND (1 <= p54)))",
"processed_size": 80,
"rewrites": 22
},
"net":
{
"conflict_clusters": 75,
"singleton_clusters": 0
},
"result":
{
"edges": 177,
"markings": 144,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 2,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 2,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "AF((((1 <= p88) AND (1 <= p107) AND (1 <= p9) AND (1 <= p92)) AND EF(((p14 <= 0) OR (p56 <= 0)))))",
"processed_size": 99,
"rewrites": 22
},
"net":
{
"conflict_clusters": 75,
"singleton_clusters": 0
},
"result":
{
"edges": 24,
"markings": 25,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1189
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "((1 <= p52) OR ((1 <= p9) AND (1 <= p105)))",
"processed_size": 43,
"rewrites": 21
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 11,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"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": "(p36 <= 0)",
"processed_size": 10,
"rewrites": 20
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 12,
"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": 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": "(p59 <= 0)",
"processed_size": 10,
"rewrites": 23
},
"result":
{
"edges": 22,
"markings": 23,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 11,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1783
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "G ((((p101 <= 0) OR (p3 <= 0) OR (p67 <= 0)) OR (F (((1 <= p6) AND (1 <= p34))) OR ((1 <= p62) AND (1 <= p83)))))",
"processed_size": 115,
"rewrites": 22
},
"result":
{
"edges": 4103,
"markings": 3708,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "universal single path",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3567
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p48) AND (1 <= p99))))",
"processed_size": 35,
"rewrites": 21
},
"result":
{
"edges": 59,
"markings": 60,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 13,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p48) AND (1 <= p99))))",
"processed_size": 35,
"rewrites": 21
},
"result":
{
"edges": 59,
"markings": 60,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "((1 <= p2) OR (1 <= p59))",
"processed_size": 26,
"rewrites": 23
},
"result":
{
"edges": 3704,
"markings": 3705,
"produced_by": "state space /EFEG",
"value": false
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "reachability_of_possible_preservation",
"workflow": "stateequation"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 26436,
"runtime": 4.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E(((A(X(**)) OR **) U (A(F(**)) AND **))) : A(F((* AND E(F(*))))) : (A(G(A(F(**)))) OR A((A(F(**)) U E(X(**))))) : (** AND (A(F(**)) OR (** OR **))) : E(((A(X(**)) OR E(F(**))) U (A(G(**)) AND E(X(**))))) : A(F(**)) : E(G(A(F(**)))) : (E(F(E(G(**)))) AND E(F(*))) : A(F((E(X(**)) AND **))) : A(((** OR E(F(**))) U **)) : NODEADLOCK : A(G((** OR (A(F(**)) OR **)))) : TRUE : A(F(E(G(E(X(**))))))"
},
"net":
{
"arcs": 276,
"conflict_clusters": 75,
"places": 110,
"places_significant": 96,
"singleton_clusters": 0,
"transitions": 98
},
"result":
{
"preliminary_value": "no no yes no no no no no no no yes yes yes no ",
"value": "no no yes no no no no no no no yes 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 CTLFireability.xml
lola: E (((A (X ((1 <= p2))) OR (1 <= p20)) U (A (F ((1 <= p104))) AND ((p64 <= 0) OR (p100 <= 0))))) : NOT(E (G ((((p88 <= 0) OR (p107 <= 0) OR (p9 <= 0) OR (p92 <= 0)) OR A (G (((1 <= p14) AND (1 <= p56)))))))) : (A (G (A (F (((p27 <= 0) OR (p54 <= 0)))))) OR A ((A (F (((1 <= p3) AND (1 <= p67)))) U E (X ((1 <= p52)))))) : ((p36 <= 0) AND ((A (F ((1 <= p59))) OR (1 <= p52)) OR ((1 <= p9) AND (1 <= p105)))) : E (((A (X ((1 <= p5))) OR E (F (((1 <= p61) AND (1 <= p96))))) U (A (G ((1 <= p2))) AND E (X (((1 <= p9) AND (1 <= p105))))))) : A (F (A (((p101 <= 0) U ((1 <= p8) AND (1 <= p47)))))) : E (G (E (G (A (F (((1 <= p45) AND (1 <= p88)))))))) : (E (F (E (G (((1 <= p2) OR (1 <= p59)))))) AND NOT(A (G (((p48 <= 0) OR (p99 <= 0)))))) : A (F ((E (X ((p87 <= 0))) AND (1 <= p95)))) : A ((((1 <= p22) OR E (F (((1 <= p61) AND (1 <= p68))))) U ((1 <= p27) AND (1 <= p54)))) : NOT(A (X ((1 <= 0)))) : A (G (((((p101 <= 0) OR (p3 <= 0) OR (p67 <= 0)) OR A (F (((1 <= p6) AND (1 <= p34))))) OR ((1 <= p62) AND (1 <= p83))))) : E (G ((0 <= 0))) : A (F (E (G (E (X (((1 <= p79) AND (1 <= p98))))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:440
lola: rewrite Frontend/Parser/formula_rewrite.k:461
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:139
lola: rewrite Frontend/Parser/formula_rewrite.k:285
lola: rewrite Frontend/Parser/formula_rewrite.k:254
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: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: NOT DEADLOCK
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: NOT DEADLOCK
lola: processed formula length: 12
lola: 20 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 0 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 1 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 20 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 0 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 2 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((A (X ((1 <= p5))) OR E (F (((1 <= p61) AND (1 <= p96))))) U (A (G ((1 <= p2))) AND E (X (((1 <= p9) AND (1 <= p105)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: E((AX((1 <= p5)) OR EF(((1 <= p61) AND (1 <= p96)))) U (AG((1 <= p2)) AND EX(((1 <= p9) AND (1 <= p105)))))
lola: processed formula length: 107
lola: 25 rewrites
lola: closed formula file CTLFireability.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 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 3708 markings, 5680 edges
lola: ========================================
lola: subprocess 3 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((E (X ((p87 <= 0))) AND (1 <= p95))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF((EX((p87 <= 0)) AND (1 <= p95)))
lola: processed formula length: 35
lola: 22 rewrites
lola: closed formula file CTLFireability.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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 25 markings, 24 edges
lola: ========================================
lola: subprocess 4 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((A (X ((1 <= p2))) OR (1 <= p20)) U (A (F ((1 <= p104))) AND ((p64 <= 0) OR (p100 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: E((AX((1 <= p2)) OR (1 <= p20)) U (AF((1 <= p104)) AND ((p64 <= 0) OR (p100 <= 0))))
lola: processed formula length: 85
lola: 23 rewrites
lola: closed formula file CTLFireability.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 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 25 markings, 25 edges
lola: ========================================
lola: subprocess 5 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (A (F (((p27 <= 0) OR (p54 <= 0)))))) OR A ((A (F (((1 <= p3) AND (1 <= p67)))) U E (X ((1 <= p52))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: processed formula: (AG(AF(((p27 <= 0) OR (p54 <= 0)))) OR A(AF(((1 <= p3) AND (1 <= p67))) U EX((1 <= p52))))
lola: processed formula length: 91
lola: 25 rewrites
lola: closed formula file CTLFireability.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 4 significant temporal operators and needs 17 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: 3708 markings, 7416 edges
lola: ========================================
lola: subprocess 6 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (E (G (E (X (((1 <= p79) AND (1 <= p98))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF(EG(EX(((1 <= p79) AND (1 <= p98)))))
lola: processed formula length: 39
lola: 23 rewrites
lola: closed formula file CTLFireability.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 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 25 markings, 49 edges
lola: ========================================
lola: subprocess 7 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((1 <= p8) AND (1 <= p47))))
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: ((p8 <= 0) OR (p47 <= 0))
lola: processed formula length: 26
lola: 23 rewrites
lola: closed formula file CTLFireability.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: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p8) AND (1 <= p47))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
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: write sara problem file to CTLFireability-7-0.sara
lola: state equation: calling and running sara
lola: ========================================
lola: subprocess 8 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (A (F (((1 <= p45) AND (1 <= p88))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG(AF(((1 <= p45) AND (1 <= p88))))
lola: processed formula length: 35
lola: 22 rewrites
lola: closed formula file CTLFireability.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: sara: try reading problem file CTLFireability-7-0.sara.
CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 25 markings, 25 edges
lola: ========================================
lola: subprocess 9 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((1 <= p22) OR E (F (((1 <= p61) AND (1 <= p68))))) U ((1 <= p27) AND (1 <= p54))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: processed formula: A(((1 <= p22) OR EF(((1 <= p61) AND (1 <= p68)))) U ((1 <= p27) AND (1 <= p54)))
lola: processed formula length: 80
lola: 22 rewrites
lola: closed formula file CTLFireability.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 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 144 markings, 177 edges
lola: ========================================
lola: subprocess 10 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((((1 <= p88) AND (1 <= p107) AND (1 <= p9) AND (1 <= p92)) AND E (F (((p14 <= 0) OR (p56 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF((((1 <= p88) AND (1 <= p107) AND (1 <= p9) AND (1 <= p92)) AND EF(((p14 <= 0) OR (p56 <= 0)))))
lola: processed formula length: 99
lola: 22 rewrites
lola: closed formula file CTLFireability.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 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 25 markings, 24 edges
lola: ========================================
lola: subprocess 11 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p36 <= 0) AND (A (F ((1 <= p59))) OR ((1 <= p52) OR ((1 <= p9) AND (1 <= p105)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p52) OR ((1 <= p9) AND (1 <= p105)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: processed formula: ((1 <= p52) OR ((1 <= p9) AND (1 <= p105)))
lola: processed formula length: 43
lola: 21 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 3 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: ========================================
sara: warning, failure of lp_solve (at job 2)
lola: subprocess 12 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p36 <= 0)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p36 <= 0)
lola: processed formula length: 10
lola: 20 rewrites
lola: closed formula file CTLFireability.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 13 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((1 <= p59)))
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: (p59 <= 0)
lola: processed formula length: 10
lola: 23 rewrites
lola: closed formula file CTLFireability.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: state equation task get result unparse finished++ id 0
lola: formula 0: (1 <= p59)
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: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 23 markings, 22 edges
lola: state equation: write sara problem file to CTLFireability-13-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-13-0.sara.
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 12 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p101 <= 0) OR (p3 <= 0) OR (p67 <= 0)) OR (A (F (((1 <= p6) AND (1 <= p34)))) OR ((1 <= p62) AND (1 <= p83))))))
lola: ========================================
lola: SUBTASK
lola: checking a universal CTL formula with single counterexample path (use LTL...)
lola: rewrite Frontend/Parser/formula_rewrite.k:679
lola: rewrite Frontend/Parser/formula_rewrite.k:679
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((((p101 <= 0) OR (p3 <= 0) OR (p67 <= 0)) OR (F (((1 <= p6) AND (1 <= p34))) OR ((1 <= p62) AND (1 <= p83)))))
lola: processed formula length: 115
lola: 22 rewrites
lola: closed formula file CTLFireability.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 insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The universal single path CTL formula holds.
lola: 3708 markings, 4103 edges
lola: ========================================

lola: subprocess 13 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (E (G (((1 <= p2) OR (1 <= p59)))))) AND E (F (((1 <= p48) AND (1 <= p99)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p48) AND (1 <= p99))))
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 (((1 <= p48) AND (1 <= p99))))
lola: processed formula length: 35
lola: 21 rewrites
lola: closed formula file CTLFireability.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: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p48) AND (1 <= p99))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-13-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 60 markings, 59 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: ========================================
lola: ========================================
lola: ...considering subproblem: (E (F (E (G (((1 <= p2) OR (1 <= p59)))))) AND E (F (((1 <= p48) AND (1 <= p99)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p48) AND (1 <= p99))))
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 (((1 <= p48) AND (1 <= p99))))
lola: processed formula length: 35
lola: 21 rewrites
lola: closed formula file CTLFireability.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: 60 markings, 59 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (F (E (G (((1 <= p2) OR (1 <= p59))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability of possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:598
lola: rewrite Frontend/Parser/formula_rewrite.k:633
lola: rewrite Frontend/Parser/formula_rewrite.k:730
lola: processed formula: ((1 <= p2) OR (1 <= p59))
lola: processed formula length: 26
lola: 23 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EFEG)
lola: state space: using reachability graph (EFEG version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
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 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: ((1 <= p2) OR (1 <= p59))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p2 <= 0) AND (p59 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EFEG
lola: The predicate is not possibly preserved from any reachable marking.
lola: 3705 markings, 3704 edges
lola: state equation: write sara problem file to CTLFireability-15-1.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no yes no no no no no no no yes yes yes no
lola:
preliminary result: no no yes no no no no no no no yes yes yes no
sara: try reading problem file CTLFireability-15-1.sara.
lola: memory consumption: 26436 KB
lola: time consumption: 4 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLFireability.json
lola: closed JSON file CTLFireability.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="CTLFireability"
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 CTLFireability"
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-158987882800756"
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 [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;