Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fko/mcc2020-input.r182-oct2-158987913900458.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is BusinessProcesses-PT-02, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r182-oct2-158987913900458
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 224K
-rw-r--r-- 1 mcc users 3.6K Mar 26 02:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 26 02:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 25 22:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 25 22:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 8 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 8 14:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.7K Mar 25 17:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 11K Mar 25 17:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 25 14:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K Mar 25 14:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 25 17:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 25 17:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 59K 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 BusinessProcesses-PT-02-00
FORMULA_NAME BusinessProcesses-PT-02-01
FORMULA_NAME BusinessProcesses-PT-02-02
FORMULA_NAME BusinessProcesses-PT-02-03
FORMULA_NAME BusinessProcesses-PT-02-04
FORMULA_NAME BusinessProcesses-PT-02-05
FORMULA_NAME BusinessProcesses-PT-02-06
FORMULA_NAME BusinessProcesses-PT-02-07
FORMULA_NAME BusinessProcesses-PT-02-08
FORMULA_NAME BusinessProcesses-PT-02-09
FORMULA_NAME BusinessProcesses-PT-02-10
FORMULA_NAME BusinessProcesses-PT-02-11
FORMULA_NAME BusinessProcesses-PT-02-12
FORMULA_NAME BusinessProcesses-PT-02-13
FORMULA_NAME BusinessProcesses-PT-02-14
FORMULA_NAME BusinessProcesses-PT-02-15

=== Now, execution of the tool begins

BK_START 1591156469688

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 03:54:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 03:54:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 03:54:31] [INFO ] Load time of PNML (sax parser for PT used): 51 ms
[2020-06-03 03:54:31] [INFO ] Transformed 262 places.
[2020-06-03 03:54:31] [INFO ] Transformed 219 transitions.
[2020-06-03 03:54:31] [INFO ] Found NUPN structural information;
[2020-06-03 03:54:31] [INFO ] Parsed PT model containing 262 places and 219 transitions in 86 ms.
Deduced a syphon composed of 17 places in 2 ms
Reduce places removed 17 places and 15 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 1357 resets, run finished after 196 ms. (steps per millisecond=510 ) properties seen :[1, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1]
// Phase 1: matrix 204 rows 245 cols
[2020-06-03 03:54:31] [INFO ] Computed 43 place invariants in 11 ms
[2020-06-03 03:54:31] [INFO ] [Real]Absence check using 30 positive place invariants in 30 ms returned sat
[2020-06-03 03:54:31] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 7 ms returned sat
[2020-06-03 03:54:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:54:31] [INFO ] [Real]Absence check using state equation in 148 ms returned sat
[2020-06-03 03:54:32] [INFO ] Deduced a trap composed of 8 places in 91 ms
[2020-06-03 03:54:32] [INFO ] Deduced a trap composed of 11 places in 63 ms
[2020-06-03 03:54:32] [INFO ] Deduced a trap composed of 15 places in 65 ms
[2020-06-03 03:54:32] [INFO ] Deduced a trap composed of 18 places in 44 ms
[2020-06-03 03:54:32] [INFO ] Deduced a trap composed of 55 places in 42 ms
[2020-06-03 03:54:32] [INFO ] Deduced a trap composed of 16 places in 43 ms
[2020-06-03 03:54:32] [INFO ] Deduced a trap composed of 34 places in 42 ms
[2020-06-03 03:54:32] [INFO ] Deduced a trap composed of 19 places in 51 ms
[2020-06-03 03:54:32] [INFO ] Deduced a trap composed of 10 places in 40 ms
[2020-06-03 03:54:32] [INFO ] Deduced a trap composed of 22 places in 27 ms
[2020-06-03 03:54:32] [INFO ] Deduced a trap composed of 35 places in 32 ms
[2020-06-03 03:54:32] [INFO ] Deduced a trap composed of 30 places in 29 ms
[2020-06-03 03:54:32] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 722 ms
[2020-06-03 03:54:32] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 03:54:32] [INFO ] [Nat]Absence check using 30 positive place invariants in 26 ms returned sat
[2020-06-03 03:54:32] [INFO ] [Nat]Absence check using 30 positive and 13 generalized place invariants in 4 ms returned sat
[2020-06-03 03:54:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 03:54:32] [INFO ] [Nat]Absence check using state equation in 140 ms returned sat
[2020-06-03 03:54:32] [INFO ] Deduced a trap composed of 8 places in 49 ms
[2020-06-03 03:54:33] [INFO ] Deduced a trap composed of 16 places in 47 ms
[2020-06-03 03:54:33] [INFO ] Deduced a trap composed of 19 places in 49 ms
[2020-06-03 03:54:33] [INFO ] Deduced a trap composed of 16 places in 51 ms
[2020-06-03 03:54:33] [INFO ] Deduced a trap composed of 19 places in 55 ms
[2020-06-03 03:54:33] [INFO ] Deduced a trap composed of 23 places in 44 ms
[2020-06-03 03:54:33] [INFO ] Deduced a trap composed of 30 places in 45 ms
[2020-06-03 03:54:33] [INFO ] Deduced a trap composed of 12 places in 43 ms
[2020-06-03 03:54:33] [INFO ] Deduced a trap composed of 34 places in 47 ms
[2020-06-03 03:54:33] [INFO ] Deduced a trap composed of 10 places in 44 ms
[2020-06-03 03:54:33] [INFO ] Deduced a trap composed of 35 places in 29 ms
[2020-06-03 03:54:33] [INFO ] Deduced a trap composed of 30 places in 33 ms
[2020-06-03 03:54:33] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 691 ms
[2020-06-03 03:54:33] [INFO ] Computed and/alt/rep : 203/553/203 causal constraints in 13 ms.
[2020-06-03 03:54:34] [INFO ] Added : 146 causal constraints over 30 iterations in 486 ms. Result :sat
[2020-06-03 03:54:34] [INFO ] [Real]Absence check using 30 positive place invariants in 18 ms returned sat
[2020-06-03 03:54:34] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 4 ms returned sat
[2020-06-03 03:54:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:54:34] [INFO ] [Real]Absence check using state equation in 147 ms returned sat
[2020-06-03 03:54:34] [INFO ] Deduced a trap composed of 8 places in 62 ms
[2020-06-03 03:54:34] [INFO ] Deduced a trap composed of 11 places in 55 ms
[2020-06-03 03:54:34] [INFO ] Deduced a trap composed of 15 places in 53 ms
[2020-06-03 03:54:34] [INFO ] Deduced a trap composed of 18 places in 48 ms
[2020-06-03 03:54:34] [INFO ] Deduced a trap composed of 55 places in 53 ms
[2020-06-03 03:54:34] [INFO ] Deduced a trap composed of 16 places in 54 ms
[2020-06-03 03:54:34] [INFO ] Deduced a trap composed of 34 places in 68 ms
[2020-06-03 03:54:34] [INFO ] Deduced a trap composed of 19 places in 86 ms
[2020-06-03 03:54:34] [INFO ] Deduced a trap composed of 10 places in 53 ms
[2020-06-03 03:54:34] [INFO ] Deduced a trap composed of 22 places in 39 ms
[2020-06-03 03:54:35] [INFO ] Deduced a trap composed of 35 places in 25 ms
[2020-06-03 03:54:35] [INFO ] Deduced a trap composed of 30 places in 22 ms
[2020-06-03 03:54:35] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 767 ms
[2020-06-03 03:54:35] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 03:54:35] [INFO ] [Nat]Absence check using 30 positive place invariants in 49 ms returned sat
[2020-06-03 03:54:35] [INFO ] [Nat]Absence check using 30 positive and 13 generalized place invariants in 4 ms returned sat
[2020-06-03 03:54:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 03:54:35] [INFO ] [Nat]Absence check using state equation in 143 ms returned sat
[2020-06-03 03:54:35] [INFO ] Deduced a trap composed of 8 places in 57 ms
[2020-06-03 03:54:35] [INFO ] Deduced a trap composed of 16 places in 48 ms
[2020-06-03 03:54:35] [INFO ] Deduced a trap composed of 19 places in 56 ms
[2020-06-03 03:54:35] [INFO ] Deduced a trap composed of 16 places in 51 ms
[2020-06-03 03:54:35] [INFO ] Deduced a trap composed of 19 places in 51 ms
[2020-06-03 03:54:35] [INFO ] Deduced a trap composed of 23 places in 108 ms
[2020-06-03 03:54:35] [INFO ] Deduced a trap composed of 30 places in 59 ms
[2020-06-03 03:54:35] [INFO ] Deduced a trap composed of 12 places in 56 ms
[2020-06-03 03:54:35] [INFO ] Deduced a trap composed of 34 places in 57 ms
[2020-06-03 03:54:36] [INFO ] Deduced a trap composed of 10 places in 597 ms
[2020-06-03 03:54:36] [INFO ] Deduced a trap composed of 35 places in 35 ms
[2020-06-03 03:54:36] [INFO ] Deduced a trap composed of 30 places in 28 ms
[2020-06-03 03:54:36] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1317 ms
[2020-06-03 03:54:36] [INFO ] Computed and/alt/rep : 203/553/203 causal constraints in 10 ms.
[2020-06-03 03:54:37] [INFO ] Added : 146 causal constraints over 30 iterations in 489 ms. Result :sat
[2020-06-03 03:54:37] [INFO ] [Real]Absence check using 30 positive place invariants in 14 ms returned sat
[2020-06-03 03:54:37] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 4 ms returned sat
[2020-06-03 03:54:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:54:37] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2020-06-03 03:54:37] [INFO ] Deduced a trap composed of 8 places in 48 ms
[2020-06-03 03:54:37] [INFO ] Deduced a trap composed of 14 places in 61 ms
[2020-06-03 03:54:37] [INFO ] Deduced a trap composed of 20 places in 51 ms
[2020-06-03 03:54:37] [INFO ] Deduced a trap composed of 17 places in 51 ms
[2020-06-03 03:54:37] [INFO ] Deduced a trap composed of 20 places in 52 ms
[2020-06-03 03:54:37] [INFO ] Deduced a trap composed of 60 places in 52 ms
[2020-06-03 03:54:37] [INFO ] Deduced a trap composed of 66 places in 52 ms
[2020-06-03 03:54:37] [INFO ] Deduced a trap composed of 63 places in 45 ms
[2020-06-03 03:54:37] [INFO ] Deduced a trap composed of 64 places in 44 ms
[2020-06-03 03:54:37] [INFO ] Deduced a trap composed of 59 places in 43 ms
[2020-06-03 03:54:37] [INFO ] Deduced a trap composed of 62 places in 42 ms
[2020-06-03 03:54:38] [INFO ] Deduced a trap composed of 65 places in 47 ms
[2020-06-03 03:54:38] [INFO ] Deduced a trap composed of 66 places in 46 ms
[2020-06-03 03:54:38] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 776 ms
[2020-06-03 03:54:38] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 03:54:38] [INFO ] [Nat]Absence check using 30 positive place invariants in 21 ms returned sat
[2020-06-03 03:54:38] [INFO ] [Nat]Absence check using 30 positive and 13 generalized place invariants in 4 ms returned sat
[2020-06-03 03:54:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 03:54:38] [INFO ] [Nat]Absence check using state equation in 135 ms returned sat
[2020-06-03 03:54:38] [INFO ] Deduced a trap composed of 8 places in 58 ms
[2020-06-03 03:54:38] [INFO ] Deduced a trap composed of 14 places in 42 ms
[2020-06-03 03:54:38] [INFO ] Deduced a trap composed of 20 places in 52 ms
[2020-06-03 03:54:38] [INFO ] Deduced a trap composed of 17 places in 50 ms
[2020-06-03 03:54:38] [INFO ] Deduced a trap composed of 20 places in 49 ms
[2020-06-03 03:54:38] [INFO ] Deduced a trap composed of 60 places in 50 ms
[2020-06-03 03:54:38] [INFO ] Deduced a trap composed of 63 places in 65 ms
[2020-06-03 03:54:38] [INFO ] Deduced a trap composed of 64 places in 109 ms
[2020-06-03 03:54:38] [INFO ] Deduced a trap composed of 17 places in 57 ms
[2020-06-03 03:54:38] [INFO ] Deduced a trap composed of 59 places in 50 ms
[2020-06-03 03:54:39] [INFO ] Deduced a trap composed of 61 places in 69 ms
[2020-06-03 03:54:39] [INFO ] Deduced a trap composed of 67 places in 161 ms
[2020-06-03 03:54:39] [INFO ] Deduced a trap composed of 68 places in 40 ms
[2020-06-03 03:54:39] [INFO ] Deduced a trap composed of 76 places in 69 ms
[2020-06-03 03:54:39] [INFO ] Deduced a trap composed of 66 places in 155 ms
[2020-06-03 03:54:39] [INFO ] Deduced a trap composed of 71 places in 124 ms
[2020-06-03 03:54:39] [INFO ] Deduced a trap composed of 11 places in 83 ms
[2020-06-03 03:54:39] [INFO ] Deduced a trap composed of 66 places in 94 ms
[2020-06-03 03:54:39] [INFO ] Deduced a trap composed of 60 places in 100 ms
[2020-06-03 03:54:39] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 1699 ms
[2020-06-03 03:54:40] [INFO ] Computed and/alt/rep : 203/553/203 causal constraints in 14 ms.
[2020-06-03 03:54:40] [INFO ] Added : 147 causal constraints over 30 iterations in 563 ms. Result :sat
[2020-06-03 03:54:40] [INFO ] Deduced a trap composed of 60 places in 190 ms
[2020-06-03 03:54:40] [INFO ] Deduced a trap composed of 62 places in 57 ms
[2020-06-03 03:54:40] [INFO ] Deduced a trap composed of 60 places in 43 ms
[2020-06-03 03:54:40] [INFO ] Deduced a trap composed of 63 places in 43 ms
[2020-06-03 03:54:41] [INFO ] Deduced a trap composed of 71 places in 61 ms
[2020-06-03 03:54:41] [INFO ] Deduced a trap composed of 64 places in 45 ms
[2020-06-03 03:54:41] [INFO ] Deduced a trap composed of 64 places in 39 ms
[2020-06-03 03:54:41] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 744 ms
[2020-06-03 03:54:41] [INFO ] [Real]Absence check using 30 positive place invariants in 14 ms returned sat
[2020-06-03 03:54:41] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 4 ms returned sat
[2020-06-03 03:54:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:54:41] [INFO ] [Real]Absence check using state equation in 138 ms returned sat
[2020-06-03 03:54:41] [INFO ] Deduced a trap composed of 14 places in 173 ms
[2020-06-03 03:54:41] [INFO ] Deduced a trap composed of 8 places in 126 ms
[2020-06-03 03:54:41] [INFO ] Deduced a trap composed of 16 places in 77 ms
[2020-06-03 03:54:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 3 trap constraints in 408 ms
[2020-06-03 03:54:41] [INFO ] [Real]Absence check using 30 positive place invariants in 21 ms returned sat
[2020-06-03 03:54:41] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 8 ms returned sat
[2020-06-03 03:54:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:54:42] [INFO ] [Real]Absence check using state equation in 392 ms returned sat
[2020-06-03 03:54:42] [INFO ] Deduced a trap composed of 10 places in 54 ms
[2020-06-03 03:54:42] [INFO ] Deduced a trap composed of 19 places in 49 ms
[2020-06-03 03:54:42] [INFO ] Deduced a trap composed of 8 places in 48 ms
[2020-06-03 03:54:42] [INFO ] Deduced a trap composed of 20 places in 54 ms
[2020-06-03 03:54:42] [INFO ] Deduced a trap composed of 16 places in 51 ms
[2020-06-03 03:54:42] [INFO ] Deduced a trap composed of 34 places in 51 ms
[2020-06-03 03:54:42] [INFO ] Deduced a trap composed of 31 places in 44 ms
[2020-06-03 03:54:42] [INFO ] Deduced a trap composed of 61 places in 47 ms
[2020-06-03 03:54:42] [INFO ] Deduced a trap composed of 67 places in 44 ms
[2020-06-03 03:54:42] [INFO ] Deduced a trap composed of 65 places in 42 ms
[2020-06-03 03:54:43] [INFO ] Deduced a trap composed of 65 places in 64 ms
[2020-06-03 03:54:43] [INFO ] Deduced a trap composed of 64 places in 81 ms
[2020-06-03 03:54:43] [INFO ] Deduced a trap composed of 65 places in 51 ms
[2020-06-03 03:54:43] [INFO ] Deduced a trap composed of 14 places in 61 ms
[2020-06-03 03:54:43] [INFO ] Deduced a trap composed of 17 places in 51 ms
[2020-06-03 03:54:43] [INFO ] Deduced a trap composed of 60 places in 51 ms
[2020-06-03 03:54:43] [INFO ] Deduced a trap composed of 58 places in 137 ms
[2020-06-03 03:54:43] [INFO ] Deduced a trap composed of 60 places in 84 ms
[2020-06-03 03:54:43] [INFO ] Deduced a trap composed of 59 places in 72 ms
[2020-06-03 03:54:43] [INFO ] Deduced a trap composed of 60 places in 74 ms
[2020-06-03 03:54:43] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 1490 ms
[2020-06-03 03:54:43] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 03:54:43] [INFO ] [Nat]Absence check using 30 positive place invariants in 18 ms returned sat
[2020-06-03 03:54:43] [INFO ] [Nat]Absence check using 30 positive and 13 generalized place invariants in 5 ms returned sat
[2020-06-03 03:54:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 03:54:44] [INFO ] [Nat]Absence check using state equation in 137 ms returned sat
[2020-06-03 03:54:44] [INFO ] Deduced a trap composed of 10 places in 53 ms
[2020-06-03 03:54:44] [INFO ] Deduced a trap composed of 19 places in 60 ms
[2020-06-03 03:54:44] [INFO ] Deduced a trap composed of 8 places in 73 ms
[2020-06-03 03:54:44] [INFO ] Deduced a trap composed of 20 places in 54 ms
[2020-06-03 03:54:44] [INFO ] Deduced a trap composed of 16 places in 49 ms
[2020-06-03 03:54:44] [INFO ] Deduced a trap composed of 34 places in 55 ms
[2020-06-03 03:54:44] [INFO ] Deduced a trap composed of 31 places in 54 ms
[2020-06-03 03:54:44] [INFO ] Deduced a trap composed of 61 places in 53 ms
[2020-06-03 03:54:44] [INFO ] Deduced a trap composed of 57 places in 51 ms
[2020-06-03 03:54:44] [INFO ] Deduced a trap composed of 58 places in 55 ms
[2020-06-03 03:54:44] [INFO ] Deduced a trap composed of 41 places in 43 ms
[2020-06-03 03:54:44] [INFO ] Deduced a trap composed of 64 places in 64 ms
[2020-06-03 03:54:44] [INFO ] Deduced a trap composed of 35 places in 39 ms
[2020-06-03 03:54:44] [INFO ] Deduced a trap composed of 57 places in 52 ms
[2020-06-03 03:54:45] [INFO ] Deduced a trap composed of 70 places in 54 ms
[2020-06-03 03:54:45] [INFO ] Deduced a trap composed of 67 places in 75 ms
[2020-06-03 03:54:45] [INFO ] Deduced a trap composed of 60 places in 56 ms
[2020-06-03 03:54:45] [INFO ] Deduced a trap composed of 65 places in 38 ms
[2020-06-03 03:54:45] [INFO ] Deduced a trap composed of 61 places in 91 ms
[2020-06-03 03:54:45] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 1278 ms
[2020-06-03 03:54:45] [INFO ] Computed and/alt/rep : 203/553/203 causal constraints in 9 ms.
[2020-06-03 03:54:45] [INFO ] Added : 135 causal constraints over 28 iterations in 504 ms. Result :sat
[2020-06-03 03:54:45] [INFO ] [Real]Absence check using 30 positive place invariants in 16 ms returned sat
[2020-06-03 03:54:45] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 4 ms returned sat
[2020-06-03 03:54:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:54:46] [INFO ] [Real]Absence check using state equation in 143 ms returned sat
[2020-06-03 03:54:46] [INFO ] Deduced a trap composed of 8 places in 60 ms
[2020-06-03 03:54:46] [INFO ] Deduced a trap composed of 55 places in 46 ms
[2020-06-03 03:54:46] [INFO ] Deduced a trap composed of 14 places in 103 ms
[2020-06-03 03:54:46] [INFO ] Deduced a trap composed of 16 places in 46 ms
[2020-06-03 03:54:46] [INFO ] Deduced a trap composed of 57 places in 57 ms
[2020-06-03 03:54:46] [INFO ] Deduced a trap composed of 16 places in 24 ms
[2020-06-03 03:54:46] [INFO ] Deduced a trap composed of 16 places in 31 ms
[2020-06-03 03:54:46] [INFO ] Deduced a trap composed of 19 places in 30 ms
[2020-06-03 03:54:46] [INFO ] Deduced a trap composed of 12 places in 36 ms
[2020-06-03 03:54:46] [INFO ] Deduced a trap composed of 18 places in 18 ms
[2020-06-03 03:54:46] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 543 ms
[2020-06-03 03:54:46] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 03:54:46] [INFO ] [Nat]Absence check using 30 positive place invariants in 21 ms returned sat
[2020-06-03 03:54:46] [INFO ] [Nat]Absence check using 30 positive and 13 generalized place invariants in 3 ms returned sat
[2020-06-03 03:54:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 03:54:46] [INFO ] [Nat]Absence check using state equation in 203 ms returned sat
[2020-06-03 03:54:46] [INFO ] Deduced a trap composed of 8 places in 83 ms
[2020-06-03 03:54:47] [INFO ] Deduced a trap composed of 55 places in 52 ms
[2020-06-03 03:54:47] [INFO ] Deduced a trap composed of 14 places in 51 ms
[2020-06-03 03:54:47] [INFO ] Deduced a trap composed of 11 places in 52 ms
[2020-06-03 03:54:47] [INFO ] Deduced a trap composed of 15 places in 51 ms
[2020-06-03 03:54:47] [INFO ] Deduced a trap composed of 15 places in 44 ms
[2020-06-03 03:54:47] [INFO ] Deduced a trap composed of 17 places in 44 ms
[2020-06-03 03:54:47] [INFO ] Deduced a trap composed of 18 places in 23 ms
[2020-06-03 03:54:47] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 476 ms
[2020-06-03 03:54:47] [INFO ] Computed and/alt/rep : 203/553/203 causal constraints in 16 ms.
[2020-06-03 03:54:47] [INFO ] Added : 137 causal constraints over 28 iterations in 532 ms. Result :sat
[2020-06-03 03:54:47] [INFO ] [Real]Absence check using 30 positive place invariants in 14 ms returned sat
[2020-06-03 03:54:47] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 4 ms returned sat
[2020-06-03 03:54:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:54:48] [INFO ] [Real]Absence check using state equation in 145 ms returned sat
[2020-06-03 03:54:48] [INFO ] Deduced a trap composed of 22 places in 68 ms
[2020-06-03 03:54:48] [INFO ] Deduced a trap composed of 58 places in 45 ms
[2020-06-03 03:54:48] [INFO ] Deduced a trap composed of 61 places in 92 ms
[2020-06-03 03:54:48] [INFO ] Deduced a trap composed of 16 places in 44 ms
[2020-06-03 03:54:48] [INFO ] Deduced a trap composed of 56 places in 46 ms
[2020-06-03 03:54:48] [INFO ] Deduced a trap composed of 17 places in 45 ms
[2020-06-03 03:54:48] [INFO ] Deduced a trap composed of 14 places in 42 ms
[2020-06-03 03:54:48] [INFO ] Deduced a trap composed of 16 places in 43 ms
[2020-06-03 03:54:48] [INFO ] Deduced a trap composed of 12 places in 44 ms
[2020-06-03 03:54:48] [INFO ] Deduced a trap composed of 17 places in 42 ms
[2020-06-03 03:54:48] [INFO ] Deduced a trap composed of 16 places in 52 ms
[2020-06-03 03:54:48] [INFO ] Deduced a trap composed of 19 places in 41 ms
[2020-06-03 03:54:48] [INFO ] Deduced a trap composed of 11 places in 41 ms
[2020-06-03 03:54:48] [INFO ] Deduced a trap composed of 60 places in 42 ms
[2020-06-03 03:54:48] [INFO ] Deduced a trap composed of 64 places in 40 ms
[2020-06-03 03:54:49] [INFO ] Deduced a trap composed of 63 places in 43 ms
[2020-06-03 03:54:49] [INFO ] Deduced a trap composed of 69 places in 45 ms
[2020-06-03 03:54:49] [INFO ] Deduced a trap composed of 62 places in 43 ms
[2020-06-03 03:54:49] [INFO ] Deduced a trap composed of 68 places in 49 ms
[2020-06-03 03:54:49] [INFO ] Deduced a trap composed of 68 places in 56 ms
[2020-06-03 03:54:49] [INFO ] Deduced a trap composed of 60 places in 39 ms
[2020-06-03 03:54:49] [INFO ] Deduced a trap composed of 59 places in 44 ms
[2020-06-03 03:54:49] [INFO ] Deduced a trap composed of 63 places in 48 ms
[2020-06-03 03:54:49] [INFO ] Deduced a trap composed of 67 places in 47 ms
[2020-06-03 03:54:49] [INFO ] Deduced a trap composed of 58 places in 46 ms
[2020-06-03 03:54:49] [INFO ] Deduced a trap composed of 59 places in 43 ms
[2020-06-03 03:54:49] [INFO ] Deduced a trap composed of 60 places in 43 ms
[2020-06-03 03:54:49] [INFO ] Deduced a trap composed of 62 places in 42 ms
[2020-06-03 03:54:49] [INFO ] Deduced a trap composed of 58 places in 42 ms
[2020-06-03 03:54:49] [INFO ] Deduced a trap composed of 60 places in 42 ms
[2020-06-03 03:54:49] [INFO ] Deduced a trap composed of 59 places in 41 ms
[2020-06-03 03:54:49] [INFO ] Deduced a trap composed of 63 places in 40 ms
[2020-06-03 03:54:49] [INFO ] Deduced a trap composed of 61 places in 44 ms
[2020-06-03 03:54:49] [INFO ] Trap strengthening (SAT) tested/added 34/33 trap constraints in 1844 ms
[2020-06-03 03:54:49] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 03:54:50] [INFO ] [Nat]Absence check using 30 positive place invariants in 20 ms returned sat
[2020-06-03 03:54:50] [INFO ] [Nat]Absence check using 30 positive and 13 generalized place invariants in 4 ms returned sat
[2020-06-03 03:54:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 03:54:50] [INFO ] [Nat]Absence check using state equation in 137 ms returned sat
[2020-06-03 03:54:50] [INFO ] Deduced a trap composed of 12 places in 55 ms
[2020-06-03 03:54:50] [INFO ] Deduced a trap composed of 11 places in 54 ms
[2020-06-03 03:54:50] [INFO ] Deduced a trap composed of 17 places in 50 ms
[2020-06-03 03:54:50] [INFO ] Deduced a trap composed of 63 places in 45 ms
[2020-06-03 03:54:50] [INFO ] Deduced a trap composed of 60 places in 44 ms
[2020-06-03 03:54:50] [INFO ] Deduced a trap composed of 20 places in 42 ms
[2020-06-03 03:54:50] [INFO ] Deduced a trap composed of 10 places in 41 ms
[2020-06-03 03:54:50] [INFO ] Deduced a trap composed of 35 places in 44 ms
[2020-06-03 03:54:50] [INFO ] Deduced a trap composed of 58 places in 57 ms
[2020-06-03 03:54:50] [INFO ] Deduced a trap composed of 61 places in 55 ms
[2020-06-03 03:54:50] [INFO ] Deduced a trap composed of 62 places in 110 ms
[2020-06-03 03:54:50] [INFO ] Deduced a trap composed of 17 places in 48 ms
[2020-06-03 03:54:50] [INFO ] Deduced a trap composed of 22 places in 23 ms
[2020-06-03 03:54:50] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 786 ms
[2020-06-03 03:54:50] [INFO ] Computed and/alt/rep : 203/553/203 causal constraints in 8 ms.
[2020-06-03 03:54:51] [INFO ] Added : 162 causal constraints over 33 iterations in 605 ms. Result :sat
[2020-06-03 03:54:51] [INFO ] Deduced a trap composed of 61 places in 77 ms
[2020-06-03 03:54:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 119 ms
[2020-06-03 03:54:51] [INFO ] [Real]Absence check using 30 positive place invariants in 24 ms returned sat
[2020-06-03 03:54:51] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 8 ms returned sat
[2020-06-03 03:54:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:54:52] [INFO ] [Real]Absence check using state equation in 271 ms returned sat
[2020-06-03 03:54:52] [INFO ] Deduced a trap composed of 8 places in 75 ms
[2020-06-03 03:54:52] [INFO ] Deduced a trap composed of 23 places in 66 ms
[2020-06-03 03:54:52] [INFO ] Deduced a trap composed of 12 places in 77 ms
[2020-06-03 03:54:52] [INFO ] Deduced a trap composed of 16 places in 49 ms
[2020-06-03 03:54:52] [INFO ] Deduced a trap composed of 16 places in 48 ms
[2020-06-03 03:54:52] [INFO ] Deduced a trap composed of 35 places in 49 ms
[2020-06-03 03:54:52] [INFO ] Deduced a trap composed of 65 places in 48 ms
[2020-06-03 03:54:52] [INFO ] Deduced a trap composed of 68 places in 47 ms
[2020-06-03 03:54:52] [INFO ] Deduced a trap composed of 60 places in 65 ms
[2020-06-03 03:54:52] [INFO ] Deduced a trap composed of 67 places in 41 ms
[2020-06-03 03:54:52] [INFO ] Deduced a trap composed of 61 places in 41 ms
[2020-06-03 03:54:52] [INFO ] Deduced a trap composed of 63 places in 58 ms
[2020-06-03 03:54:52] [INFO ] Deduced a trap composed of 62 places in 71 ms
[2020-06-03 03:54:52] [INFO ] Deduced a trap composed of 65 places in 43 ms
[2020-06-03 03:54:53] [INFO ] Deduced a trap composed of 64 places in 44 ms
[2020-06-03 03:54:53] [INFO ] Deduced a trap composed of 64 places in 76 ms
[2020-06-03 03:54:53] [INFO ] Deduced a trap composed of 63 places in 43 ms
[2020-06-03 03:54:53] [INFO ] Deduced a trap composed of 71 places in 43 ms
[2020-06-03 03:54:53] [INFO ] Deduced a trap composed of 60 places in 39 ms
[2020-06-03 03:54:53] [INFO ] Deduced a trap composed of 75 places in 41 ms
[2020-06-03 03:54:53] [INFO ] Deduced a trap composed of 69 places in 40 ms
[2020-06-03 03:54:53] [INFO ] Deduced a trap composed of 59 places in 48 ms
[2020-06-03 03:54:53] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 1433 ms
[2020-06-03 03:54:53] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 03:54:53] [INFO ] [Nat]Absence check using 30 positive place invariants in 21 ms returned sat
[2020-06-03 03:54:53] [INFO ] [Nat]Absence check using 30 positive and 13 generalized place invariants in 10 ms returned sat
[2020-06-03 03:54:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 03:54:53] [INFO ] [Nat]Absence check using state equation in 140 ms returned sat
[2020-06-03 03:54:53] [INFO ] Deduced a trap composed of 8 places in 57 ms
[2020-06-03 03:54:53] [INFO ] Deduced a trap composed of 23 places in 49 ms
[2020-06-03 03:54:53] [INFO ] Deduced a trap composed of 64 places in 67 ms
[2020-06-03 03:54:53] [INFO ] Deduced a trap composed of 62 places in 61 ms
[2020-06-03 03:54:54] [INFO ] Deduced a trap composed of 14 places in 90 ms
[2020-06-03 03:54:54] [INFO ] Deduced a trap composed of 17 places in 73 ms
[2020-06-03 03:54:54] [INFO ] Deduced a trap composed of 21 places in 59 ms
[2020-06-03 03:54:54] [INFO ] Deduced a trap composed of 21 places in 47 ms
[2020-06-03 03:54:54] [INFO ] Deduced a trap composed of 16 places in 46 ms
[2020-06-03 03:54:54] [INFO ] Deduced a trap composed of 35 places in 47 ms
[2020-06-03 03:54:54] [INFO ] Deduced a trap composed of 61 places in 49 ms
[2020-06-03 03:54:54] [INFO ] Deduced a trap composed of 58 places in 49 ms
[2020-06-03 03:54:54] [INFO ] Deduced a trap composed of 60 places in 45 ms
[2020-06-03 03:54:54] [INFO ] Deduced a trap composed of 63 places in 42 ms
[2020-06-03 03:54:54] [INFO ] Deduced a trap composed of 57 places in 45 ms
[2020-06-03 03:54:54] [INFO ] Deduced a trap composed of 57 places in 61 ms
[2020-06-03 03:54:54] [INFO ] Deduced a trap composed of 58 places in 42 ms
[2020-06-03 03:54:54] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 1169 ms
[2020-06-03 03:54:54] [INFO ] Computed and/alt/rep : 203/553/203 causal constraints in 17 ms.
[2020-06-03 03:54:55] [INFO ] Added : 170 causal constraints over 35 iterations in 736 ms. Result :sat
[2020-06-03 03:54:55] [INFO ] Deduced a trap composed of 58 places in 75 ms
[2020-06-03 03:54:55] [INFO ] Deduced a trap composed of 61 places in 52 ms
[2020-06-03 03:54:55] [INFO ] Deduced a trap composed of 60 places in 48 ms
[2020-06-03 03:54:55] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 258 ms
[2020-06-03 03:54:55] [INFO ] [Real]Absence check using 30 positive place invariants in 14 ms returned sat
[2020-06-03 03:54:55] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 4 ms returned sat
[2020-06-03 03:54:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:54:56] [INFO ] [Real]Absence check using state equation in 179 ms returned sat
[2020-06-03 03:54:56] [INFO ] Deduced a trap composed of 18 places in 226 ms
[2020-06-03 03:54:56] [INFO ] Deduced a trap composed of 12 places in 52 ms
[2020-06-03 03:54:56] [INFO ] Deduced a trap composed of 8 places in 61 ms
[2020-06-03 03:54:56] [INFO ] Deduced a trap composed of 62 places in 55 ms
[2020-06-03 03:54:56] [INFO ] Deduced a trap composed of 19 places in 96 ms
[2020-06-03 03:54:56] [INFO ] Deduced a trap composed of 17 places in 63 ms
[2020-06-03 03:54:56] [INFO ] Deduced a trap composed of 21 places in 52 ms
[2020-06-03 03:54:56] [INFO ] Deduced a trap composed of 15 places in 53 ms
[2020-06-03 03:54:56] [INFO ] Deduced a trap composed of 63 places in 53 ms
[2020-06-03 03:54:56] [INFO ] Deduced a trap composed of 63 places in 76 ms
[2020-06-03 03:54:57] [INFO ] Deduced a trap composed of 64 places in 104 ms
[2020-06-03 03:54:57] [INFO ] Deduced a trap composed of 67 places in 42 ms
[2020-06-03 03:54:57] [INFO ] Deduced a trap composed of 58 places in 41 ms
[2020-06-03 03:54:57] [INFO ] Deduced a trap composed of 23 places in 30 ms
[2020-06-03 03:54:57] [INFO ] Deduced a trap composed of 31 places in 33 ms
[2020-06-03 03:54:57] [INFO ] Deduced a trap composed of 36 places in 31 ms
[2020-06-03 03:54:57] [INFO ] Deduced a trap composed of 12 places in 19 ms
[2020-06-03 03:54:57] [INFO ] Deduced a trap composed of 18 places in 15 ms
[2020-06-03 03:54:57] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 1391 ms
[2020-06-03 03:54:57] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 03:54:57] [INFO ] [Nat]Absence check using 30 positive place invariants in 21 ms returned sat
[2020-06-03 03:54:57] [INFO ] [Nat]Absence check using 30 positive and 13 generalized place invariants in 4 ms returned sat
[2020-06-03 03:54:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 03:54:57] [INFO ] [Nat]Absence check using state equation in 136 ms returned sat
[2020-06-03 03:54:57] [INFO ] Deduced a trap composed of 18 places in 135 ms
[2020-06-03 03:54:57] [INFO ] Deduced a trap composed of 13 places in 74 ms
[2020-06-03 03:54:57] [INFO ] Deduced a trap composed of 15 places in 50 ms
[2020-06-03 03:54:58] [INFO ] Deduced a trap composed of 8 places in 749 ms
[2020-06-03 03:54:58] [INFO ] Deduced a trap composed of 11 places in 46 ms
[2020-06-03 03:54:58] [INFO ] Deduced a trap composed of 54 places in 48 ms
[2020-06-03 03:54:58] [INFO ] Deduced a trap composed of 19 places in 54 ms
[2020-06-03 03:54:58] [INFO ] Deduced a trap composed of 22 places in 46 ms
[2020-06-03 03:54:58] [INFO ] Deduced a trap composed of 19 places in 47 ms
[2020-06-03 03:54:59] [INFO ] Deduced a trap composed of 23 places in 45 ms
[2020-06-03 03:54:59] [INFO ] Deduced a trap composed of 39 places in 44 ms
[2020-06-03 03:54:59] [INFO ] Deduced a trap composed of 22 places in 55 ms
[2020-06-03 03:54:59] [INFO ] Deduced a trap composed of 21 places in 54 ms
[2020-06-03 03:54:59] [INFO ] Deduced a trap composed of 37 places in 48 ms
[2020-06-03 03:54:59] [INFO ] Deduced a trap composed of 58 places in 52 ms
[2020-06-03 03:54:59] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 1670 ms
[2020-06-03 03:54:59] [INFO ] Computed and/alt/rep : 203/553/203 causal constraints in 10 ms.
[2020-06-03 03:54:59] [INFO ] Added : 165 causal constraints over 34 iterations in 554 ms. Result :sat
[2020-06-03 03:54:59] [INFO ] Deduced a trap composed of 57 places in 50 ms
[2020-06-03 03:55:00] [INFO ] Deduced a trap composed of 62 places in 45 ms
[2020-06-03 03:55:00] [INFO ] Deduced a trap composed of 66 places in 54 ms
[2020-06-03 03:55:00] [INFO ] Deduced a trap composed of 58 places in 54 ms
[2020-06-03 03:55:00] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 304 ms
[2020-06-03 03:55:00] [INFO ] [Real]Absence check using 30 positive place invariants in 13 ms returned sat
[2020-06-03 03:55:00] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 4 ms returned sat
[2020-06-03 03:55:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:55:00] [INFO ] [Real]Absence check using state equation in 164 ms returned sat
[2020-06-03 03:55:00] [INFO ] Deduced a trap composed of 12 places in 87 ms
[2020-06-03 03:55:00] [INFO ] Deduced a trap composed of 8 places in 53 ms
[2020-06-03 03:55:00] [INFO ] Deduced a trap composed of 67 places in 44 ms
[2020-06-03 03:55:00] [INFO ] Deduced a trap composed of 20 places in 47 ms
[2020-06-03 03:55:00] [INFO ] Deduced a trap composed of 11 places in 40 ms
[2020-06-03 03:55:00] [INFO ] Deduced a trap composed of 20 places in 54 ms
[2020-06-03 03:55:00] [INFO ] Deduced a trap composed of 30 places in 45 ms
[2020-06-03 03:55:00] [INFO ] Deduced a trap composed of 16 places in 45 ms
[2020-06-03 03:55:00] [INFO ] Deduced a trap composed of 30 places in 58 ms
[2020-06-03 03:55:01] [INFO ] Deduced a trap composed of 33 places in 36 ms
[2020-06-03 03:55:01] [INFO ] Deduced a trap composed of 25 places in 35 ms
[2020-06-03 03:55:01] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 666 ms
[2020-06-03 03:55:01] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 03:55:01] [INFO ] [Nat]Absence check using 30 positive place invariants in 21 ms returned sat
[2020-06-03 03:55:01] [INFO ] [Nat]Absence check using 30 positive and 13 generalized place invariants in 4 ms returned sat
[2020-06-03 03:55:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 03:55:01] [INFO ] [Nat]Absence check using state equation in 135 ms returned sat
[2020-06-03 03:55:01] [INFO ] Deduced a trap composed of 12 places in 46 ms
[2020-06-03 03:55:01] [INFO ] Deduced a trap composed of 15 places in 42 ms
[2020-06-03 03:55:01] [INFO ] Deduced a trap composed of 16 places in 67 ms
[2020-06-03 03:55:01] [INFO ] Deduced a trap composed of 13 places in 78 ms
[2020-06-03 03:55:01] [INFO ] Deduced a trap composed of 59 places in 62 ms
[2020-06-03 03:55:01] [INFO ] Deduced a trap composed of 14 places in 60 ms
[2020-06-03 03:55:01] [INFO ] Deduced a trap composed of 25 places in 45 ms
[2020-06-03 03:55:01] [INFO ] Deduced a trap composed of 31 places in 43 ms
[2020-06-03 03:55:01] [INFO ] Deduced a trap composed of 24 places in 46 ms
[2020-06-03 03:55:01] [INFO ] Deduced a trap composed of 17 places in 45 ms
[2020-06-03 03:55:01] [INFO ] Deduced a trap composed of 32 places in 44 ms
[2020-06-03 03:55:02] [INFO ] Deduced a trap composed of 23 places in 42 ms
[2020-06-03 03:55:02] [INFO ] Deduced a trap composed of 58 places in 40 ms
[2020-06-03 03:55:03] [INFO ] Deduced a trap composed of 41 places in 1061 ms
[2020-06-03 03:55:03] [INFO ] Deduced a trap composed of 25 places in 175 ms
[2020-06-03 03:55:03] [INFO ] Deduced a trap composed of 39 places in 129 ms
[2020-06-03 03:55:03] [INFO ] Deduced a trap composed of 19 places in 108 ms
[2020-06-03 03:55:03] [INFO ] Deduced a trap composed of 43 places in 99 ms
[2020-06-03 03:55:03] [INFO ] Deduced a trap composed of 8 places in 57 ms
[2020-06-03 03:55:03] [INFO ] Deduced a trap composed of 12 places in 43 ms
[2020-06-03 03:55:03] [INFO ] Deduced a trap composed of 16 places in 40 ms
[2020-06-03 03:55:03] [INFO ] Deduced a trap composed of 40 places in 49 ms
[2020-06-03 03:55:04] [INFO ] Deduced a trap composed of 64 places in 50 ms
[2020-06-03 03:55:04] [INFO ] Deduced a trap composed of 61 places in 47 ms
[2020-06-03 03:55:04] [INFO ] Deduced a trap composed of 65 places in 46 ms
[2020-06-03 03:55:04] [INFO ] Deduced a trap composed of 21 places in 48 ms
[2020-06-03 03:55:04] [INFO ] Deduced a trap composed of 60 places in 48 ms
[2020-06-03 03:55:04] [INFO ] Deduced a trap composed of 63 places in 48 ms
[2020-06-03 03:55:04] [INFO ] Deduced a trap composed of 20 places in 46 ms
[2020-06-03 03:55:04] [INFO ] Deduced a trap composed of 58 places in 42 ms
[2020-06-03 03:55:04] [INFO ] Trap strengthening (SAT) tested/added 31/30 trap constraints in 3152 ms
[2020-06-03 03:55:04] [INFO ] Computed and/alt/rep : 203/553/203 causal constraints in 8 ms.
[2020-06-03 03:55:04] [INFO ] Added : 162 causal constraints over 33 iterations in 523 ms. Result :sat
[2020-06-03 03:55:05] [INFO ] Deduced a trap composed of 56 places in 141 ms
[2020-06-03 03:55:05] [INFO ] Deduced a trap composed of 59 places in 115 ms
[2020-06-03 03:55:05] [INFO ] Deduced a trap composed of 59 places in 91 ms
[2020-06-03 03:55:05] [INFO ] Deduced a trap composed of 58 places in 134 ms
[2020-06-03 03:55:05] [INFO ] Deduced a trap composed of 61 places in 115 ms
[2020-06-03 03:55:05] [INFO ] Deduced a trap composed of 62 places in 113 ms
[2020-06-03 03:55:05] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 869 ms
[2020-06-03 03:55:05] [INFO ] [Real]Absence check using 30 positive place invariants in 76 ms returned sat
[2020-06-03 03:55:05] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 9 ms returned sat
[2020-06-03 03:55:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:55:06] [INFO ] [Real]Absence check using state equation in 144 ms returned sat
[2020-06-03 03:55:06] [INFO ] Deduced a trap composed of 8 places in 53 ms
[2020-06-03 03:55:06] [INFO ] Deduced a trap composed of 8 places in 52 ms
[2020-06-03 03:55:06] [INFO ] Deduced a trap composed of 15 places in 67 ms
[2020-06-03 03:55:06] [INFO ] Deduced a trap composed of 14 places in 51 ms
[2020-06-03 03:55:06] [INFO ] Deduced a trap composed of 15 places in 45 ms
[2020-06-03 03:55:06] [INFO ] Deduced a trap composed of 12 places in 48 ms
[2020-06-03 03:55:06] [INFO ] Deduced a trap composed of 16 places in 47 ms
[2020-06-03 03:55:06] [INFO ] Deduced a trap composed of 12 places in 51 ms
[2020-06-03 03:55:06] [INFO ] Deduced a trap composed of 20 places in 50 ms
[2020-06-03 03:55:06] [INFO ] Deduced a trap composed of 30 places in 72 ms
[2020-06-03 03:55:06] [INFO ] Deduced a trap composed of 60 places in 50 ms
[2020-06-03 03:55:06] [INFO ] Deduced a trap composed of 63 places in 48 ms
[2020-06-03 03:55:06] [INFO ] Deduced a trap composed of 31 places in 44 ms
[2020-06-03 03:55:06] [INFO ] Deduced a trap composed of 61 places in 43 ms
[2020-06-03 03:55:07] [INFO ] Deduced a trap composed of 59 places in 51 ms
[2020-06-03 03:55:07] [INFO ] Deduced a trap composed of 20 places in 22 ms
[2020-06-03 03:55:07] [INFO ] Deduced a trap composed of 57 places in 44 ms
[2020-06-03 03:55:07] [INFO ] Deduced a trap composed of 58 places in 48 ms
[2020-06-03 03:55:07] [INFO ] Deduced a trap composed of 63 places in 46 ms
[2020-06-03 03:55:07] [INFO ] Deduced a trap composed of 60 places in 45 ms
[2020-06-03 03:55:07] [INFO ] Deduced a trap composed of 62 places in 46 ms
[2020-06-03 03:55:07] [INFO ] Deduced a trap composed of 58 places in 44 ms
[2020-06-03 03:55:07] [INFO ] Deduced a trap composed of 58 places in 44 ms
[2020-06-03 03:55:07] [INFO ] Deduced a trap composed of 58 places in 44 ms
[2020-06-03 03:55:07] [INFO ] Deduced a trap composed of 61 places in 44 ms
[2020-06-03 03:55:07] [INFO ] Deduced a trap composed of 61 places in 43 ms
[2020-06-03 03:55:07] [INFO ] Deduced a trap composed of 62 places in 39 ms
[2020-06-03 03:55:07] [INFO ] Deduced a trap composed of 65 places in 41 ms
[2020-06-03 03:55:07] [INFO ] Deduced a trap composed of 65 places in 41 ms
[2020-06-03 03:55:07] [INFO ] Deduced a trap composed of 56 places in 39 ms
[2020-06-03 03:55:07] [INFO ] Deduced a trap composed of 58 places in 41 ms
[2020-06-03 03:55:07] [INFO ] Deduced a trap composed of 55 places in 43 ms
[2020-06-03 03:55:07] [INFO ] Deduced a trap composed of 59 places in 40 ms
[2020-06-03 03:55:07] [INFO ] Trap strengthening (SAT) tested/added 34/33 trap constraints in 1849 ms
[2020-06-03 03:55:07] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 03:55:08] [INFO ] [Nat]Absence check using 30 positive place invariants in 22 ms returned sat
[2020-06-03 03:55:08] [INFO ] [Nat]Absence check using 30 positive and 13 generalized place invariants in 4 ms returned sat
[2020-06-03 03:55:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 03:55:08] [INFO ] [Nat]Absence check using state equation in 144 ms returned sat
[2020-06-03 03:55:08] [INFO ] Deduced a trap composed of 8 places in 58 ms
[2020-06-03 03:55:08] [INFO ] Deduced a trap composed of 8 places in 52 ms
[2020-06-03 03:55:08] [INFO ] Deduced a trap composed of 15 places in 52 ms
[2020-06-03 03:55:08] [INFO ] Deduced a trap composed of 14 places in 47 ms
[2020-06-03 03:55:08] [INFO ] Deduced a trap composed of 63 places in 50 ms
[2020-06-03 03:55:08] [INFO ] Deduced a trap composed of 22 places in 52 ms
[2020-06-03 03:55:08] [INFO ] Deduced a trap composed of 17 places in 215 ms
[2020-06-03 03:55:08] [INFO ] Deduced a trap composed of 56 places in 65 ms
[2020-06-03 03:55:08] [INFO ] Deduced a trap composed of 31 places in 108 ms
[2020-06-03 03:55:09] [INFO ] Deduced a trap composed of 59 places in 59 ms
[2020-06-03 03:55:09] [INFO ] Deduced a trap composed of 20 places in 56 ms
[2020-06-03 03:55:09] [INFO ] Deduced a trap composed of 61 places in 53 ms
[2020-06-03 03:55:09] [INFO ] Deduced a trap composed of 41 places in 54 ms
[2020-06-03 03:55:09] [INFO ] Deduced a trap composed of 64 places in 140 ms
[2020-06-03 03:55:09] [INFO ] Deduced a trap composed of 66 places in 105 ms
[2020-06-03 03:55:09] [INFO ] Deduced a trap composed of 42 places in 54 ms
[2020-06-03 03:55:09] [INFO ] Deduced a trap composed of 60 places in 49 ms
[2020-06-03 03:55:09] [INFO ] Deduced a trap composed of 66 places in 138 ms
[2020-06-03 03:55:09] [INFO ] Deduced a trap composed of 16 places in 104 ms
[2020-06-03 03:55:10] [INFO ] Deduced a trap composed of 19 places in 106 ms
[2020-06-03 03:55:10] [INFO ] Deduced a trap composed of 39 places in 46 ms
[2020-06-03 03:55:10] [INFO ] Deduced a trap composed of 40 places in 38 ms
[2020-06-03 03:55:10] [INFO ] Deduced a trap composed of 61 places in 42 ms
[2020-06-03 03:55:10] [INFO ] Deduced a trap composed of 15 places in 27 ms
[2020-06-03 03:55:10] [INFO ] Deduced a trap composed of 29 places in 48 ms
[2020-06-03 03:55:10] [INFO ] Deduced a trap composed of 19 places in 49 ms
[2020-06-03 03:55:10] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 2187 ms
[2020-06-03 03:55:10] [INFO ] Computed and/alt/rep : 203/553/203 causal constraints in 10 ms.
[2020-06-03 03:55:10] [INFO ] Added : 161 causal constraints over 33 iterations in 505 ms. Result :sat
[2020-06-03 03:55:10] [INFO ] Deduced a trap composed of 57 places in 70 ms
[2020-06-03 03:55:11] [INFO ] Deduced a trap composed of 54 places in 49 ms
[2020-06-03 03:55:11] [INFO ] Deduced a trap composed of 58 places in 41 ms
[2020-06-03 03:55:11] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 251 ms
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2020-06-03 03:55:11] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2020-06-03 03:55:11] [INFO ] Flatten gal took : 69 ms
FORMULA BusinessProcesses-PT-02-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-02-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-02-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-02-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-02-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-02-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 03:55:11] [INFO ] Applying decomposition
[2020-06-03 03:55:11] [INFO ] Flatten gal took : 47 ms
[2020-06-03 03:55:11] [INFO ] Decomposing Gal with order
[2020-06-03 03:55:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-06-03 03:55:11] [INFO ] Flatten gal took : 64 ms
[2020-06-03 03:55:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 9 ms.
[2020-06-03 03:55:11] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 5 ms.
[2020-06-03 03:55:11] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 3 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ BusinessProcesses-PT-02 @ 3570 seconds

FORMULA BusinessProcesses-PT-02-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-02-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-02-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-02-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-02-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-02-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-02-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-02-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-02-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BusinessProcesses-PT-02-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3566
rslt: Output for LTLFireability @ BusinessProcesses-PT-02

{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=LTLFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--safe",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed Jun 3 03:55:11 2020
",
"timelimit": 3570
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "F ((F (((1 <= p76))) AND (((p186 <= 0)) AND ((1 <= p156)))))",
"processed_size": 60,
"rewrites": 66
},
"result":
{
"edges": 67,
"markings": 67,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "X (G (((p76 <= 0))))",
"processed_size": 20,
"rewrites": 66
},
"result":
{
"edges": 8273,
"markings": 2287,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 1,
"aconj": 1,
"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": "(((p171 <= 0)) U X (((1 <= p165))))",
"processed_size": 35,
"rewrites": 66
},
"result":
{
"edges": 136,
"markings": 136,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 1,
"X": 2,
"aconj": 3,
"adisj": 0,
"aneg": 0,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "G (F (((((1 <= p36) AND (1 <= p148) AND (1 <= p184)) U X (F (((1 <= p36) AND (1 <= p148) AND (1 <= p184))))) AND X (((1 <= p49))))))",
"processed_size": 132,
"rewrites": 66
},
"result":
{
"edges": 127,
"markings": 127,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 2,
"aconj": 4,
"adisj": 0,
"aneg": 2,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "(X ((((1 <= p160)) OR (((p25 <= 0)) R X (((p160 <= 0)))))) U ((1 <= p179)))",
"processed_size": 75,
"rewrites": 66
},
"result":
{
"edges": 195,
"markings": 195,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 1,
"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": "X ((G (((1 <= p121))) AND ((p22 <= 0))))",
"processed_size": 40,
"rewrites": 66
},
"result":
{
"edges": 126,
"markings": 126,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 3,
"aconj": 2,
"adisj": 1,
"aneg": 1,
"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": "X (G ((X ((X (((1 <= p141))) AND ((p65 <= 0) OR (p137 <= 0) OR (p238 <= 0)))) OR ((p149 <= 0)))))",
"processed_size": 99,
"rewrites": 66
},
"result":
{
"edges": 126,
"markings": 126,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 1,
"aconj": 3,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G ((F (((1 <= p67))) AND (((1 <= p185)) OR X (F (((1 <= p67)))))))",
"processed_size": 66,
"rewrites": 66
},
"result":
{
"edges": 125,
"markings": 125,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1188
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"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": "F (G (((1 <= p55))))",
"processed_size": 20,
"rewrites": 66
},
"result":
{
"edges": 69,
"markings": 68,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1783
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 0,
"aneg": 3,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G (F ((G (((p176 <= 0))) OR (((p156 <= 0)) AND ((p176 <= 0))))))",
"processed_size": 64,
"rewrites": 66
},
"result":
{
"edges": 92,
"markings": 88,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3566
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "F ((F (((1 <= p14))) OR ((1 <= p37) AND (1 <= p152) AND (1 <= p238))))",
"processed_size": 70,
"rewrites": 66
},
"result":
{
"edges": 132,
"markings": 132,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 1
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 30780,
"runtime": 4.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(F((F(**) AND (** AND **))) OR X(G(**))) : (** U X(**)) : G(F(((** U X(F(**))) AND X(**)))) : G(F((G(*) OR (* AND *)))) : F(G(**)) : (X((** OR (* R X(*)))) U **) : X((G(**) AND **)) : X(G((X((X(**) AND **)) OR *))) : G((F(**) AND (** OR X(F(**))))) : F((F(**) OR **))"
},
"net":
{
"arcs": 546,
"conflict_clusters": 192,
"places": 245,
"places_significant": 202,
"singleton_clusters": 0,
"transitions": 204
},
"result":
{
"preliminary_value": "no no no no no no no no no no ",
"value": "no no no no no no no no no 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: 449/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 245
lola: finding significant places
lola: 245 places, 204 transitions, 202 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from LTLFireability.xml
lola: LP says that atomic proposition is always true: (p76 <= 1)
lola: LP says that atomic proposition is always true: (p186 <= 1)
lola: LP says that atomic proposition is always true: (p156 <= 1)
lola: LP says that atomic proposition is always true: (p76 <= 1)
lola: LP says that atomic proposition is always true: (p171 <= 1)
lola: LP says that atomic proposition is always true: (p67 <= 1)
lola: LP says that atomic proposition is always true: (p165 <= 1)
lola: LP says that atomic proposition is always true: (p36 <= 1)
lola: LP says that atomic proposition is always true: (p148 <= 1)
lola: LP says that atomic proposition is always true: (p184 <= 1)
lola: LP says that atomic proposition is always true: (p36 <= 1)
lola: LP says that atomic proposition is always true: (p148 <= 1)
lola: LP says that atomic proposition is always true: (p184 <= 1)
lola: LP says that atomic proposition is always true: (p49 <= 1)
lola: LP says that atomic proposition is always true: (p206 <= 1)
lola: LP says that atomic proposition is always true: (p156 <= 1)
lola: LP says that atomic proposition is always true: (p176 <= 1)
lola: LP says that atomic proposition is always true: (p55 <= 1)
lola: LP says that atomic proposition is always true: (p160 <= 1)
lola: LP says that atomic proposition is always true: (p25 <= 1)
lola: LP says that atomic proposition is always true: (p160 <= 1)
lola: LP says that atomic proposition is always true: (p179 <= 1)
lola: LP says that atomic proposition is always true: (p121 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p141 <= 1)
lola: LP says that atomic proposition is always true: (p65 <= 1)
lola: LP says that atomic proposition is always true: (p137 <= 1)
lola: LP says that atomic proposition is always true: (p238 <= 1)
lola: LP says that atomic proposition is always true: (p149 <= 1)
lola: LP says that atomic proposition is always true: (p185 <= 1)
lola: LP says that atomic proposition is always true: (p118 <= 1)
lola: LP says that atomic proposition is always true: (p67 <= 1)
lola: LP says that atomic proposition is always true: (p14 <= 1)
lola: LP says that atomic proposition is always true: (p37 <= 1)
lola: LP says that atomic proposition is always true: (p152 <= 1)
lola: LP says that atomic proposition is always true: (p238 <= 1)
lola: (F (((F (((1 <= p76))) AND ((p186 <= 0))) AND ((1 <= p156)))) OR X (G (((p76 <= 0))))) : (((p171 <= 0)) U X ((F (G ((((1 <= p67)) U (1 <= 0)))) OR ((1 <= p165))))) : G (F (X (X (((((1 <= p36) AND (1 <= p148) AND (1 <= p184)) U X (F (((1 <= p36) AND (1 <= p148) AND (1 <= p184))))) AND X (((1 <= p49)))))))) : (NOT(G (((p206 <= 0)))) U G (F (G (NOT(X (X (G ((((1 <= p156)) U ((1 <= p176))))))))))) : X (F (X (F (X (G (((1 <= p55)))))))) : ((X (((1 <= p160))) OR NOT(X ((((1 <= p25)) U X (((1 <= p160))))))) U ((1 <= p179))) : X ((G (((1 <= p121))) AND ((p22 <= 0)))) : G ((NOT(X (NOT(X ((X (((1 <= p141))) AND ((p65 <= 0) OR (p137 <= 0) OR (p238 <= 0))))))) OR NOT(X (((1 <= p149)))))) : G ((((1 <= p185)) U X (F ((((1 <= p118)) U F (((1 <= p67)))))))) : F ((F (((1 <= p14))) OR ((1 <= p37) AND (1 <= p152) AND (1 <= p238))))
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:425
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((F (((1 <= p76))) AND (((p186 <= 0)) AND ((1 <= p156))))) OR X (G (((p76 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((F (((1 <= p76))) AND (((p186 <= 0)) AND ((1 <= p156)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((F (((1 <= p76))) AND (((p186 <= 0)) AND ((1 <= p156)))))
lola: processed formula length: 60
lola: 66 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 67 markings, 67 edges
lola: ========================================
lola: subprocess 1 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G (((p76 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G (((p76 <= 0))))
lola: processed formula length: 20
lola: 66 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 2287 markings, 8273 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p171 <= 0)) U X (((1 <= p165))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (((p171 <= 0)) U X (((1 <= p165))))
lola: processed formula length: 35
lola: 66 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 136 markings, 136 edges
lola: ========================================
lola: subprocess 2 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((((1 <= p36) AND (1 <= p148) AND (1 <= p184)) U X (F (((1 <= p36) AND (1 <= p148) AND (1 <= p184))))) AND X (((1 <= p49))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F (((((1 <= p36) AND (1 <= p148) AND (1 <= p184)) U X (F (((1 <= p36) AND (1 <= p148) AND (1 <= p184))))) AND X (((1 <= p49))))))
lola: processed formula length: 132
lola: 66 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 127 markings, 127 edges
lola: ========================================
lola: subprocess 3 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((((1 <= p160)) OR (((p25 <= 0)) R X (((p160 <= 0)))))) U ((1 <= p179)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (X ((((1 <= p160)) OR (((p25 <= 0)) R X (((p160 <= 0)))))) U ((1 <= p179)))
lola: processed formula length: 75
lola: 66 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 195 markings, 195 edges
lola: ========================================
lola: subprocess 4 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((G (((1 <= p121))) AND ((p22 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G (((1 <= p121))) AND ((p22 <= 0))))
lola: processed formula length: 40
lola: 66 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 126 markings, 126 edges
lola: ========================================
lola: subprocess 5 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((X ((X (((1 <= p141))) AND ((p65 <= 0) OR (p137 <= 0) OR (p238 <= 0)))) OR ((p149 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((X ((X (((1 <= p141))) AND ((p65 <= 0) OR (p137 <= 0) OR (p238 <= 0)))) OR ((p149 <= 0)))))
lola: processed formula length: 99
lola: 66 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 126 markings, 126 edges
lola: ========================================
lola: subprocess 6 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((F (((1 <= p67))) AND (((1 <= p185)) OR X (F (((1 <= p67)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F (((1 <= p67))) AND (((1 <= p185)) OR X (F (((1 <= p67)))))))
lola: processed formula length: 66
lola: 66 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 125 markings, 125 edges
lola: ========================================
lola: subprocess 7 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((1 <= p55))))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G (((1 <= p55))))
lola: processed formula length: 20
lola: 66 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 68 markings, 69 edges
lola: ========================================
lola: subprocess 8 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((G (((p176 <= 0))) OR (((p156 <= 0)) AND ((p176 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((G (((p176 <= 0))) OR (((p156 <= 0)) AND ((p176 <= 0))))))
lola: processed formula length: 64
lola: 66 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 88 markings, 92 edges
lola: ========================================
lola: subprocess 9 will run for 3566 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((F (((1 <= p14))) OR ((1 <= p37) AND (1 <= p152) AND (1 <= p238))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((F (((1 <= p14))) OR ((1 <= p37) AND (1 <= p152) AND (1 <= p238))))
lola: processed formula length: 70
lola: 66 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 1 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 132 markings, 132 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no no no no no no no
lola:
preliminary result: no no no no no no no no no no
lola: memory consumption: 30780 KB
lola: time consumption: 4 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLFireability.json
lola: closed JSON file LTLFireability.json
rslt: finished

--------------------
content from stderr:

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BusinessProcesses-PT-02"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itslola"
echo " Input is BusinessProcesses-PT-02, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r182-oct2-158987913900458"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-02.tgz
mv BusinessProcesses-PT-02 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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