Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r151-tall-162089151200186.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2020
Input is ParamProductionCell-PT-1, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r151-tall-162089151200186
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 600K
-rw-r--r-- 1 mcc users 23K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 146K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 17K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 92K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K Mar 28 16:23 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 16:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 28 16:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K Mar 27 06:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 27 06:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.3K Mar 25 07:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 25 07:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 2 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 174K May 5 16:51 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ParamProductionCell-PT-1-00
FORMULA_NAME ParamProductionCell-PT-1-01
FORMULA_NAME ParamProductionCell-PT-1-02
FORMULA_NAME ParamProductionCell-PT-1-03
FORMULA_NAME ParamProductionCell-PT-1-04
FORMULA_NAME ParamProductionCell-PT-1-05
FORMULA_NAME ParamProductionCell-PT-1-06
FORMULA_NAME ParamProductionCell-PT-1-07
FORMULA_NAME ParamProductionCell-PT-1-08
FORMULA_NAME ParamProductionCell-PT-1-09
FORMULA_NAME ParamProductionCell-PT-1-10
FORMULA_NAME ParamProductionCell-PT-1-11
FORMULA_NAME ParamProductionCell-PT-1-12
FORMULA_NAME ParamProductionCell-PT-1-13
FORMULA_NAME ParamProductionCell-PT-1-14
FORMULA_NAME ParamProductionCell-PT-1-15

=== Now, execution of the tool begins

BK_START 1621005759095

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-14 15:22:40] [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]
[2021-05-14 15:22:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-14 15:22:40] [INFO ] Load time of PNML (sax parser for PT used): 70 ms
[2021-05-14 15:22:40] [INFO ] Transformed 231 places.
[2021-05-14 15:22:40] [INFO ] Transformed 202 transitions.
[2021-05-14 15:22:40] [INFO ] Found NUPN structural information;
[2021-05-14 15:22:40] [INFO ] Parsed PT model containing 231 places and 202 transitions in 111 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 25 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 389 ms. (steps per millisecond=257 ) properties seen :[0, 1, 0, 0, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 202 rows 231 cols
[2021-05-14 15:22:41] [INFO ] Computed 59 place invariants in 12 ms
[2021-05-14 15:22:41] [INFO ] [Real]Absence check using 35 positive place invariants in 31 ms returned sat
[2021-05-14 15:22:41] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 9 ms returned sat
[2021-05-14 15:22:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 15:22:41] [INFO ] [Real]Absence check using state equation in 162 ms returned sat
[2021-05-14 15:22:41] [INFO ] State equation strengthened by 68 read => feed constraints.
[2021-05-14 15:22:41] [INFO ] [Real]Added 68 Read/Feed constraints in 28 ms returned sat
[2021-05-14 15:22:41] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 15:22:41] [INFO ] [Nat]Absence check using 35 positive place invariants in 21 ms returned sat
[2021-05-14 15:22:41] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 9 ms returned sat
[2021-05-14 15:22:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 15:22:42] [INFO ] [Nat]Absence check using state equation in 161 ms returned sat
[2021-05-14 15:22:42] [INFO ] [Nat]Added 68 Read/Feed constraints in 14 ms returned sat
[2021-05-14 15:22:42] [INFO ] Deduced a trap composed of 7 places in 87 ms
[2021-05-14 15:22:42] [INFO ] Deduced a trap composed of 6 places in 63 ms
[2021-05-14 15:22:42] [INFO ] Deduced a trap composed of 5 places in 57 ms
[2021-05-14 15:22:42] [INFO ] Deduced a trap composed of 7 places in 58 ms
[2021-05-14 15:22:42] [INFO ] Deduced a trap composed of 7 places in 56 ms
[2021-05-14 15:22:42] [INFO ] Deduced a trap composed of 10 places in 55 ms
[2021-05-14 15:22:42] [INFO ] Deduced a trap composed of 78 places in 53 ms
[2021-05-14 15:22:42] [INFO ] Deduced a trap composed of 28 places in 50 ms
[2021-05-14 15:22:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 8 trap constraints in 571 ms
[2021-05-14 15:22:42] [INFO ] [Real]Absence check using 35 positive place invariants in 20 ms returned sat
[2021-05-14 15:22:42] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 8 ms returned sat
[2021-05-14 15:22:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 15:22:42] [INFO ] [Real]Absence check using state equation in 151 ms returned sat
[2021-05-14 15:22:42] [INFO ] [Real]Added 68 Read/Feed constraints in 25 ms returned sat
[2021-05-14 15:22:42] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 15:22:42] [INFO ] [Nat]Absence check using 35 positive place invariants in 16 ms returned sat
[2021-05-14 15:22:43] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 8 ms returned sat
[2021-05-14 15:22:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 15:22:43] [INFO ] [Nat]Absence check using state equation in 173 ms returned sat
[2021-05-14 15:22:43] [INFO ] [Nat]Added 68 Read/Feed constraints in 12 ms returned sat
[2021-05-14 15:22:43] [INFO ] Deduced a trap composed of 7 places in 60 ms
[2021-05-14 15:22:43] [INFO ] Deduced a trap composed of 8 places in 62 ms
[2021-05-14 15:22:43] [INFO ] Deduced a trap composed of 5 places in 59 ms
[2021-05-14 15:22:43] [INFO ] Deduced a trap composed of 8 places in 59 ms
[2021-05-14 15:22:43] [INFO ] Deduced a trap composed of 13 places in 59 ms
[2021-05-14 15:22:43] [INFO ] Deduced a trap composed of 26 places in 62 ms
[2021-05-14 15:22:43] [INFO ] Deduced a trap composed of 10 places in 56 ms
[2021-05-14 15:22:43] [INFO ] Deduced a trap composed of 5 places in 58 ms
[2021-05-14 15:22:43] [INFO ] Deduced a trap composed of 9 places in 57 ms
[2021-05-14 15:22:43] [INFO ] Deduced a trap composed of 51 places in 58 ms
[2021-05-14 15:22:43] [INFO ] Deduced a trap composed of 40 places in 62 ms
[2021-05-14 15:22:44] [INFO ] Deduced a trap composed of 78 places in 51 ms
[2021-05-14 15:22:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 12 trap constraints in 828 ms
[2021-05-14 15:22:44] [INFO ] [Real]Absence check using 35 positive place invariants in 15 ms returned sat
[2021-05-14 15:22:44] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 9 ms returned sat
[2021-05-14 15:22:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 15:22:44] [INFO ] [Real]Absence check using state equation in 146 ms returned sat
[2021-05-14 15:22:44] [INFO ] [Real]Added 68 Read/Feed constraints in 26 ms returned sat
[2021-05-14 15:22:44] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 15:22:44] [INFO ] [Nat]Absence check using 35 positive place invariants in 15 ms returned sat
[2021-05-14 15:22:44] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 8 ms returned sat
[2021-05-14 15:22:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 15:22:44] [INFO ] [Nat]Absence check using state equation in 145 ms returned sat
[2021-05-14 15:22:44] [INFO ] [Nat]Added 68 Read/Feed constraints in 12 ms returned sat
[2021-05-14 15:22:44] [INFO ] Deduced a trap composed of 7 places in 65 ms
[2021-05-14 15:22:44] [INFO ] Deduced a trap composed of 6 places in 72 ms
[2021-05-14 15:22:44] [INFO ] Deduced a trap composed of 5 places in 56 ms
[2021-05-14 15:22:44] [INFO ] Deduced a trap composed of 7 places in 73 ms
[2021-05-14 15:22:44] [INFO ] Deduced a trap composed of 7 places in 54 ms
[2021-05-14 15:22:44] [INFO ] Deduced a trap composed of 10 places in 57 ms
[2021-05-14 15:22:44] [INFO ] Deduced a trap composed of 78 places in 46 ms
[2021-05-14 15:22:45] [INFO ] Deduced a trap composed of 28 places in 52 ms
[2021-05-14 15:22:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 8 trap constraints in 550 ms
[2021-05-14 15:22:45] [INFO ] [Real]Absence check using 35 positive place invariants in 15 ms returned sat
[2021-05-14 15:22:45] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 12 ms returned sat
[2021-05-14 15:22:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 15:22:45] [INFO ] [Real]Absence check using state equation in 153 ms returned sat
[2021-05-14 15:22:45] [INFO ] [Real]Added 68 Read/Feed constraints in 24 ms returned sat
[2021-05-14 15:22:45] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 15:22:45] [INFO ] [Nat]Absence check using 35 positive place invariants in 16 ms returned sat
[2021-05-14 15:22:45] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 11 ms returned sat
[2021-05-14 15:22:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 15:22:45] [INFO ] [Nat]Absence check using state equation in 149 ms returned sat
[2021-05-14 15:22:45] [INFO ] [Nat]Added 68 Read/Feed constraints in 11 ms returned sat
[2021-05-14 15:22:45] [INFO ] Deduced a trap composed of 6 places in 80 ms
[2021-05-14 15:22:45] [INFO ] Deduced a trap composed of 7 places in 56 ms
[2021-05-14 15:22:45] [INFO ] Deduced a trap composed of 5 places in 56 ms
[2021-05-14 15:22:45] [INFO ] Deduced a trap composed of 5 places in 64 ms
[2021-05-14 15:22:45] [INFO ] Deduced a trap composed of 26 places in 55 ms
[2021-05-14 15:22:45] [INFO ] Deduced a trap composed of 14 places in 57 ms
[2021-05-14 15:22:45] [INFO ] Deduced a trap composed of 24 places in 54 ms
[2021-05-14 15:22:46] [INFO ] Deduced a trap composed of 45 places in 57 ms
[2021-05-14 15:22:46] [INFO ] Deduced a trap composed of 34 places in 61 ms
[2021-05-14 15:22:46] [INFO ] Deduced a trap composed of 7 places in 64 ms
[2021-05-14 15:22:46] [INFO ] Deduced a trap composed of 38 places in 63 ms
[2021-05-14 15:22:46] [INFO ] Deduced a trap composed of 53 places in 62 ms
[2021-05-14 15:22:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 12 trap constraints in 853 ms
[2021-05-14 15:22:46] [INFO ] [Real]Absence check using 35 positive place invariants in 15 ms returned sat
[2021-05-14 15:22:46] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 8 ms returned sat
[2021-05-14 15:22:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 15:22:46] [INFO ] [Real]Absence check using state equation in 155 ms returned sat
[2021-05-14 15:22:46] [INFO ] [Real]Added 68 Read/Feed constraints in 18 ms returned sat
[2021-05-14 15:22:46] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 15:22:46] [INFO ] [Nat]Absence check using 35 positive place invariants in 16 ms returned sat
[2021-05-14 15:22:46] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 9 ms returned sat
[2021-05-14 15:22:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 15:22:46] [INFO ] [Nat]Absence check using state equation in 145 ms returned sat
[2021-05-14 15:22:46] [INFO ] [Nat]Added 68 Read/Feed constraints in 13 ms returned sat
[2021-05-14 15:22:46] [INFO ] Deduced a trap composed of 7 places in 60 ms
[2021-05-14 15:22:46] [INFO ] Deduced a trap composed of 6 places in 73 ms
[2021-05-14 15:22:47] [INFO ] Deduced a trap composed of 7 places in 58 ms
[2021-05-14 15:22:47] [INFO ] Deduced a trap composed of 5 places in 68 ms
[2021-05-14 15:22:47] [INFO ] Deduced a trap composed of 7 places in 57 ms
[2021-05-14 15:22:47] [INFO ] Deduced a trap composed of 27 places in 57 ms
[2021-05-14 15:22:47] [INFO ] Deduced a trap composed of 58 places in 59 ms
[2021-05-14 15:22:47] [INFO ] Deduced a trap composed of 24 places in 50 ms
[2021-05-14 15:22:47] [INFO ] Deduced a trap composed of 41 places in 67 ms
[2021-05-14 15:22:47] [INFO ] Deduced a trap composed of 52 places in 57 ms
[2021-05-14 15:22:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 10 trap constraints in 702 ms
[2021-05-14 15:22:47] [INFO ] [Real]Absence check using 35 positive place invariants in 16 ms returned sat
[2021-05-14 15:22:47] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 8 ms returned sat
[2021-05-14 15:22:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 15:22:47] [INFO ] [Real]Absence check using state equation in 150 ms returned sat
[2021-05-14 15:22:47] [INFO ] [Real]Added 68 Read/Feed constraints in 18 ms returned sat
[2021-05-14 15:22:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 15:22:47] [INFO ] [Nat]Absence check using 35 positive place invariants in 17 ms returned sat
[2021-05-14 15:22:47] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 8 ms returned sat
[2021-05-14 15:22:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 15:22:47] [INFO ] [Nat]Absence check using state equation in 155 ms returned sat
[2021-05-14 15:22:47] [INFO ] [Nat]Added 68 Read/Feed constraints in 14 ms returned sat
[2021-05-14 15:22:48] [INFO ] Deduced a trap composed of 7 places in 61 ms
[2021-05-14 15:22:48] [INFO ] Deduced a trap composed of 6 places in 63 ms
[2021-05-14 15:22:48] [INFO ] Deduced a trap composed of 7 places in 60 ms
[2021-05-14 15:22:48] [INFO ] Deduced a trap composed of 5 places in 63 ms
[2021-05-14 15:22:48] [INFO ] Deduced a trap composed of 7 places in 66 ms
[2021-05-14 15:22:48] [INFO ] Deduced a trap composed of 27 places in 60 ms
[2021-05-14 15:22:48] [INFO ] Deduced a trap composed of 58 places in 61 ms
[2021-05-14 15:22:48] [INFO ] Deduced a trap composed of 24 places in 52 ms
[2021-05-14 15:22:48] [INFO ] Deduced a trap composed of 41 places in 60 ms
[2021-05-14 15:22:48] [INFO ] Deduced a trap composed of 52 places in 59 ms
[2021-05-14 15:22:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 10 trap constraints in 695 ms
[2021-05-14 15:22:48] [INFO ] [Real]Absence check using 35 positive place invariants in 16 ms returned sat
[2021-05-14 15:22:48] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 8 ms returned sat
[2021-05-14 15:22:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 15:22:48] [INFO ] [Real]Absence check using state equation in 148 ms returned sat
[2021-05-14 15:22:48] [INFO ] [Real]Added 68 Read/Feed constraints in 16 ms returned sat
[2021-05-14 15:22:48] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 15:22:48] [INFO ] [Nat]Absence check using 35 positive place invariants in 19 ms returned sat
[2021-05-14 15:22:48] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 8 ms returned sat
[2021-05-14 15:22:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 15:22:49] [INFO ] [Nat]Absence check using state equation in 164 ms returned sat
[2021-05-14 15:22:49] [INFO ] [Nat]Added 68 Read/Feed constraints in 10 ms returned sat
[2021-05-14 15:22:49] [INFO ] Deduced a trap composed of 10 places in 57 ms
[2021-05-14 15:22:49] [INFO ] Deduced a trap composed of 5 places in 58 ms
[2021-05-14 15:22:49] [INFO ] Deduced a trap composed of 22 places in 55 ms
[2021-05-14 15:22:49] [INFO ] Deduced a trap composed of 27 places in 59 ms
[2021-05-14 15:22:49] [INFO ] Deduced a trap composed of 5 places in 54 ms
[2021-05-14 15:22:49] [INFO ] Deduced a trap composed of 13 places in 54 ms
[2021-05-14 15:22:49] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 398 ms
[2021-05-14 15:22:49] [INFO ] Computed and/alt/rep : 201/572/201 causal constraints in 12 ms.
[2021-05-14 15:22:50] [INFO ] Added : 201 causal constraints over 41 iterations in 648 ms. Result :sat
[2021-05-14 15:22:50] [INFO ] Deduced a trap composed of 7 places in 26 ms
[2021-05-14 15:22:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 56 ms
[2021-05-14 15:22:50] [INFO ] [Real]Absence check using 35 positive place invariants in 11 ms returned unsat
[2021-05-14 15:22:50] [INFO ] [Real]Absence check using 35 positive place invariants in 17 ms returned sat
[2021-05-14 15:22:50] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 5 ms returned unsat
[2021-05-14 15:22:50] [INFO ] [Real]Absence check using 35 positive place invariants in 15 ms returned sat
[2021-05-14 15:22:50] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 5 ms returned unsat
[2021-05-14 15:22:50] [INFO ] [Real]Absence check using 35 positive place invariants in 16 ms returned sat
[2021-05-14 15:22:50] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 9 ms returned sat
[2021-05-14 15:22:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 15:22:50] [INFO ] [Real]Absence check using state equation in 156 ms returned sat
[2021-05-14 15:22:50] [INFO ] [Real]Added 68 Read/Feed constraints in 18 ms returned sat
[2021-05-14 15:22:50] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 15:22:50] [INFO ] [Nat]Absence check using 35 positive place invariants in 15 ms returned sat
[2021-05-14 15:22:50] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 8 ms returned sat
[2021-05-14 15:22:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 15:22:50] [INFO ] [Nat]Absence check using state equation in 147 ms returned sat
[2021-05-14 15:22:50] [INFO ] [Nat]Added 68 Read/Feed constraints in 12 ms returned sat
[2021-05-14 15:22:50] [INFO ] Deduced a trap composed of 5 places in 67 ms
[2021-05-14 15:22:50] [INFO ] Deduced a trap composed of 7 places in 63 ms
[2021-05-14 15:22:51] [INFO ] Deduced a trap composed of 8 places in 64 ms
[2021-05-14 15:22:51] [INFO ] Deduced a trap composed of 10 places in 65 ms
[2021-05-14 15:22:51] [INFO ] Deduced a trap composed of 10 places in 65 ms
[2021-05-14 15:22:51] [INFO ] Deduced a trap composed of 5 places in 52 ms
[2021-05-14 15:22:51] [INFO ] Deduced a trap composed of 41 places in 53 ms
[2021-05-14 15:22:51] [INFO ] Deduced a trap composed of 27 places in 63 ms
[2021-05-14 15:22:51] [INFO ] Deduced a trap composed of 27 places in 59 ms
[2021-05-14 15:22:51] [INFO ] Deduced a trap composed of 81 places in 70 ms
[2021-05-14 15:22:51] [INFO ] Deduced a trap composed of 12 places in 52 ms
[2021-05-14 15:22:51] [INFO ] Deduced a trap composed of 11 places in 51 ms
[2021-05-14 15:22:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 12 trap constraints in 854 ms
[2021-05-14 15:22:51] [INFO ] [Real]Absence check using 35 positive place invariants in 15 ms returned sat
[2021-05-14 15:22:51] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 9 ms returned sat
[2021-05-14 15:22:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 15:22:51] [INFO ] [Real]Absence check using state equation in 159 ms returned sat
[2021-05-14 15:22:51] [INFO ] [Real]Added 68 Read/Feed constraints in 38 ms returned sat
[2021-05-14 15:22:51] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 15:22:52] [INFO ] [Nat]Absence check using 35 positive place invariants in 16 ms returned sat
[2021-05-14 15:22:52] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 8 ms returned sat
[2021-05-14 15:22:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 15:22:52] [INFO ] [Nat]Absence check using state equation in 153 ms returned sat
[2021-05-14 15:22:52] [INFO ] [Nat]Added 68 Read/Feed constraints in 10 ms returned sat
[2021-05-14 15:22:52] [INFO ] Deduced a trap composed of 5 places in 71 ms
[2021-05-14 15:22:52] [INFO ] Deduced a trap composed of 5 places in 69 ms
[2021-05-14 15:22:52] [INFO ] Deduced a trap composed of 5 places in 63 ms
[2021-05-14 15:22:52] [INFO ] Deduced a trap composed of 8 places in 68 ms
[2021-05-14 15:22:52] [INFO ] Deduced a trap composed of 44 places in 71 ms
[2021-05-14 15:22:52] [INFO ] Deduced a trap composed of 7 places in 66 ms
[2021-05-14 15:22:52] [INFO ] Deduced a trap composed of 21 places in 53 ms
[2021-05-14 15:22:52] [INFO ] Deduced a trap composed of 54 places in 69 ms
[2021-05-14 15:22:52] [INFO ] Deduced a trap composed of 14 places in 67 ms
[2021-05-14 15:22:52] [INFO ] Deduced a trap composed of 83 places in 68 ms
[2021-05-14 15:22:53] [INFO ] Deduced a trap composed of 8 places in 67 ms
[2021-05-14 15:22:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 11 trap constraints in 845 ms
[2021-05-14 15:22:53] [INFO ] [Real]Absence check using 35 positive place invariants in 16 ms returned sat
[2021-05-14 15:22:53] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 9 ms returned sat
[2021-05-14 15:22:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 15:22:53] [INFO ] [Real]Absence check using state equation in 159 ms returned sat
[2021-05-14 15:22:53] [INFO ] [Real]Added 68 Read/Feed constraints in 21 ms returned sat
[2021-05-14 15:22:53] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 15:22:53] [INFO ] [Nat]Absence check using 35 positive place invariants in 16 ms returned sat
[2021-05-14 15:22:53] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 8 ms returned sat
[2021-05-14 15:22:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 15:22:53] [INFO ] [Nat]Absence check using state equation in 150 ms returned sat
[2021-05-14 15:22:53] [INFO ] [Nat]Added 68 Read/Feed constraints in 12 ms returned sat
[2021-05-14 15:22:53] [INFO ] Deduced a trap composed of 6 places in 67 ms
[2021-05-14 15:22:53] [INFO ] Deduced a trap composed of 7 places in 63 ms
[2021-05-14 15:22:53] [INFO ] Deduced a trap composed of 10 places in 63 ms
[2021-05-14 15:22:53] [INFO ] Deduced a trap composed of 5 places in 50 ms
[2021-05-14 15:22:53] [INFO ] Deduced a trap composed of 7 places in 52 ms
[2021-05-14 15:22:53] [INFO ] Deduced a trap composed of 7 places in 38 ms
[2021-05-14 15:22:53] [INFO ] Deduced a trap composed of 49 places in 33 ms
[2021-05-14 15:22:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 7 trap constraints in 428 ms
[2021-05-14 15:22:53] [INFO ] [Real]Absence check using 35 positive place invariants in 15 ms returned sat
[2021-05-14 15:22:53] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 9 ms returned sat
[2021-05-14 15:22:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 15:22:54] [INFO ] [Real]Absence check using state equation in 152 ms returned sat
[2021-05-14 15:22:54] [INFO ] [Real]Added 68 Read/Feed constraints in 20 ms returned sat
[2021-05-14 15:22:54] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 15:22:54] [INFO ] [Nat]Absence check using 35 positive place invariants in 16 ms returned sat
[2021-05-14 15:22:54] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 10 ms returned sat
[2021-05-14 15:22:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 15:22:54] [INFO ] [Nat]Absence check using state equation in 159 ms returned sat
[2021-05-14 15:22:54] [INFO ] [Nat]Added 68 Read/Feed constraints in 12 ms returned sat
[2021-05-14 15:22:54] [INFO ] Deduced a trap composed of 8 places in 61 ms
[2021-05-14 15:22:54] [INFO ] Deduced a trap composed of 5 places in 61 ms
[2021-05-14 15:22:54] [INFO ] Deduced a trap composed of 10 places in 55 ms
[2021-05-14 15:22:54] [INFO ] Deduced a trap composed of 10 places in 32 ms
[2021-05-14 15:22:54] [INFO ] Deduced a trap composed of 21 places in 32 ms
[2021-05-14 15:22:54] [INFO ] Deduced a trap composed of 25 places in 36 ms
[2021-05-14 15:22:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 6 trap constraints in 328 ms
Successfully simplified 13 atomic propositions for a total of 13 simplifications.
[2021-05-14 15:22:54] [INFO ] Initial state reduction rules for CTL removed 7 formulas.
[2021-05-14 15:22:54] [INFO ] Flatten gal took : 51 ms
FORMULA ParamProductionCell-PT-1-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-1-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-1-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-1-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-1-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-1-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-1-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-14 15:22:54] [INFO ] Applying decomposition
[2021-05-14 15:22:54] [INFO ] Flatten gal took : 18 ms
[2021-05-14 15:22:54] [INFO ] Decomposing Gal with order
[2021-05-14 15:22:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 15:22:55] [INFO ] Removed a total of 156 redundant transitions.
[2021-05-14 15:22:55] [INFO ] Flatten gal took : 110 ms
[2021-05-14 15:22:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 73 labels/synchronizations in 11 ms.
[2021-05-14 15:22:55] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2021-05-14 15:22:55] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 4 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ ParamProductionCell-PT-1 @ 3570 seconds

FORMULA ParamProductionCell-PT-1-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ParamProductionCell-PT-1-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ParamProductionCell-PT-1-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ParamProductionCell-PT-1-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ParamProductionCell-PT-1-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ParamProductionCell-PT-1-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ParamProductionCell-PT-1-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ParamProductionCell-PT-1-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ParamProductionCell-PT-1-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3567
rslt: Output for LTLFireability @ ParamProductionCell-PT-1

{
"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": "Fri May 14 15:22:56 2021
",
"timelimit": 3570
},
"child":
[

{
"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": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (G (((p21 <= 0) OR (p27 <= 0))))",
"processed_size": 35,
"rewrites": 50
},
"result":
{
"edges": 268,
"markings": 268,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 1,
"X": 1,
"aconj": 4,
"adisj": 0,
"aneg": 3,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "(X (G ((G (((p78 <= 0) OR (p85 <= 0))) OR (((p200 <= 0)) OR ((p212 <= 0)))))) U ((1 <= p78) AND (1 <= p85)))",
"processed_size": 109,
"rewrites": 50
},
"result":
{
"edges": 260,
"markings": 260,
"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": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"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": "X (F (((1 <= p148))))",
"processed_size": 21,
"rewrites": 50
},
"result":
{
"edges": 122,
"markings": 97,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"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": 594
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"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": "((p199 <= 0) OR (p217 <= 0))",
"processed_size": 29,
"rewrites": 50
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 3,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"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": "X (((1 <= p14) AND (1 <= p145)))",
"processed_size": 32,
"rewrites": 50
},
"result":
{
"edges": 260,
"markings": 260,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 0,
"aneg": 2,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(((p199 <= 0) OR (p217 <= 0)) R X (G (((p199 <= 0) OR (p217 <= 0)))))",
"processed_size": 71,
"rewrites": 50
},
"result":
{
"edges": 260,
"markings": 260,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 3,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 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": "F (G (((1 <= p42) AND (1 <= p52))))",
"processed_size": 35,
"rewrites": 50
},
"result":
{
"edges": 195,
"markings": 194,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 4,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "G (F (((p113 <= 0) OR (p114 <= 0) OR (p122 <= 0))))",
"processed_size": 53,
"rewrites": 50
},
"result":
{
"edges": 164,
"markings": 164,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1189
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"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": "G (F ((F (((1 <= p114) AND (1 <= p140))) OR ((1 <= p45) AND (1 <= p56)))))",
"processed_size": 74,
"rewrites": 50
},
"result":
{
"edges": 1828,
"markings": 859,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 6,
"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": 1783
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1783
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "((p199 <= 0) OR (p200 <= 0) OR (p213 <= 0) OR (p45 <= 0) OR (p46 <= 0) OR (p51 <= 0))",
"processed_size": 90,
"rewrites": 50
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 7,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3567
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"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": "G (F (((p204 <= 0) OR (p215 <= 0))))",
"processed_size": 37,
"rewrites": 50
},
"result":
{
"edges": 164,
"markings": 164,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 7,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3567
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 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": "((1 <= p176))",
"processed_size": 13,
"rewrites": 50
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 8,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"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": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "F ((F (G (((1 <= p39) AND (1 <= p41) AND (1 <= p58)))) AND ((1 <= p176))))",
"processed_size": 74,
"rewrites": 50
},
"result":
{
"edges": 193,
"markings": 193,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 8,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "((p199 <= 0) OR (p200 <= 0) OR (p213 <= 0) OR (p45 <= 0) OR (p46 <= 0) OR (p51 <= 0))",
"processed_size": 90,
"rewrites": 50
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 9,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"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": "G (F (((p204 <= 0) OR (p215 <= 0))))",
"processed_size": 37,
"rewrites": 50
},
"result":
{
"edges": 164,
"markings": 164,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 0,
"aneg": 3,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "F ((G (((p45 <= 0) OR (p46 <= 0) OR (p51 <= 0))) OR (((p199 <= 0) OR (p200 <= 0) OR (p213 <= 0)) AND ((p45 <= 0) OR (p46 <= 0) OR (p51 <= 0)))))",
"processed_size": 150,
"rewrites": 50
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 9,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 37108,
"runtime": 3.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X(G(**)) : (F((G(*) OR (* AND *))) AND (G(F(*)) AND **)) : G(F((F(**) OR **))) : (X(G((G(*) OR (* OR *)))) U **) : ((F(G(**)) AND **) OR (F((F(G(**)) AND **)) AND F(G(**)))) : X(F(**)) : (X(**) OR ((* R X(G(*))) AND **)) : (F(G(**)) AND X(G(**))) : G(F(**))"
},
"net":
{
"arcs": 846,
"conflict_clusters": 59,
"places": 231,
"places_significant": 172,
"singleton_clusters": 0,
"transitions": 202
},
"result":
{
"preliminary_value": "no yes yes no no yes no no yes ",
"value": "no yes yes no no yes no no yes "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 433/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 231
lola: finding significant places
lola: 231 places, 202 transitions, 172 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: (p21 <= 1)
lola: LP says that atomic proposition is always true: (p27 <= 1)
lola: LP says that atomic proposition is always true: (p199 <= 1)
lola: LP says that atomic proposition is always true: (p200 <= 1)
lola: LP says that atomic proposition is always true: (p213 <= 1)
lola: LP says that atomic proposition is always true: (p45 <= 1)
lola: LP says that atomic proposition is always true: (p46 <= 1)
lola: LP says that atomic proposition is always true: (p51 <= 1)
lola: LP says that atomic proposition is always true: (p204 <= 1)
lola: LP says that atomic proposition is always true: (p215 <= 1)
lola: LP says that atomic proposition is always true: (p199 <= 1)
lola: LP says that atomic proposition is always true: (p200 <= 1)
lola: LP says that atomic proposition is always true: (p213 <= 1)
lola: LP says that atomic proposition is always true: (p45 <= 1)
lola: LP says that atomic proposition is always true: (p46 <= 1)
lola: LP says that atomic proposition is always true: (p51 <= 1)
lola: LP says that atomic proposition is always true: (p114 <= 1)
lola: LP says that atomic proposition is always true: (p140 <= 1)
lola: LP says that atomic proposition is always true: (p45 <= 1)
lola: LP says that atomic proposition is always true: (p56 <= 1)
lola: LP says that atomic proposition is always true: (p78 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p200 <= 1)
lola: LP says that atomic proposition is always true: (p212 <= 1)
lola: LP says that atomic proposition is always true: (p78 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p39 <= 1)
lola: LP says that atomic proposition is always true: (p41 <= 1)
lola: LP says that atomic proposition is always true: (p58 <= 1)
lola: LP says that atomic proposition is always true: (p76 <= 1)
lola: LP says that atomic proposition is always true: (p78 <= 1)
lola: LP says that atomic proposition is always true: (p86 <= 1)
lola: LP says that atomic proposition is always true: (p39 <= 1)
lola: LP says that atomic proposition is always true: (p41 <= 1)
lola: LP says that atomic proposition is always true: (p58 <= 1)
lola: LP says that atomic proposition is always true: (p176 <= 1)
lola: LP says that atomic proposition is always true: (p148 <= 1)
lola: LP says that atomic proposition is always true: (p14 <= 1)
lola: LP says that atomic proposition is always true: (p145 <= 1)
lola: LP says that atomic proposition is always true: (p199 <= 1)
lola: LP says that atomic proposition is always true: (p217 <= 1)
lola: LP says that atomic proposition is always true: (p199 <= 1)
lola: LP says that atomic proposition is always true: (p217 <= 1)
lola: LP says that atomic proposition is always true: (p199 <= 1)
lola: LP says that atomic proposition is always true: (p217 <= 1)
lola: LP says that atomic proposition is always true: (p42 <= 1)
lola: LP says that atomic proposition is always true: (p52 <= 1)
lola: LP says that atomic proposition is always true: (p201 <= 1)
lola: LP says that atomic proposition is always true: (p210 <= 1)
lola: LP says that atomic proposition is always true: (p113 <= 1)
lola: LP says that atomic proposition is always true: (p114 <= 1)
lola: LP says that atomic proposition is always true: (p122 <= 1)
lola: G (X (((1 <= 0) U ((p21 <= 0) OR (p27 <= 0))))) : ((NOT(G ((((1 <= p199) AND (1 <= p200) AND (1 <= p213)) U ((1 <= p45) AND (1 <= p46) AND (1 <= p51))))) AND G (NOT(X (G (((1 <= p204) AND (1 <= p215))))))) AND ((p199 <= 0) OR (p200 <= 0) OR (p213 <= 0) OR (p45 <= 0) OR (p46 <= 0) OR (p51 <= 0))) : G (X (X (X (G (F (X ((F (((1 <= p114) AND (1 <= p140))) OR ((1 <= p45) AND (1 <= p56)))))))))) : (G (NOT(X (((F (((1 <= p78) AND (1 <= p85))) AND ((1 <= p200))) AND ((1 <= p212)))))) U ((1 <= p78) AND (1 <= p85))) : (G (F ((((1 <= p39) AND (1 <= p41) AND (1 <= p58)) U X (G (((1 <= p76) AND (1 <= p78) AND (1 <= p86))))))) U (F (G (((1 <= p39) AND (1 <= p41) AND (1 <= p58)))) AND ((1 <= p176)))) : X (F (((1 <= 0) U F (((1 <= p148)))))) : (X (((1 <= p14) AND (1 <= p145))) OR (NOT((((1 <= p199) AND (1 <= p217)) U X (F (((1 <= p199) AND (1 <= p217)))))) AND ((p199 <= 0) OR (p217 <= 0)))) : (F (G (((1 <= p42) AND (1 <= p52)))) AND G (X (((1 <= p201) AND (1 <= p210))))) : G (X (G (F (((p113 <= 0) OR (p114 <= 0) OR (p122 <= 0))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k: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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:356
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:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
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:434
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:428
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:347
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G (((p21 <= 0) OR (p27 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G (((p21 <= 0) OR (p27 <= 0))))
lola: processed formula length: 35
lola: 50 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: 268 markings, 268 edges
lola: ========================================
lola: subprocess 1 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (G ((G (((p78 <= 0) OR (p85 <= 0))) OR (((p200 <= 0)) OR ((p212 <= 0)))))) U ((1 <= p78) AND (1 <= p85)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (X (G ((G (((p78 <= 0) OR (p85 <= 0))) OR (((p200 <= 0)) OR ((p212 <= 0)))))) U ((1 <= p78) AND (1 <= p85)))
lola: processed formula length: 109
lola: 50 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: 260 markings, 260 edges
lola: ========================================
lola: subprocess 2 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F (((1 <= p148))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F (((1 <= p148))))
lola: processed formula length: 21
lola: 50 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 97 markings, 122 edges
lola: ========================================
lola: subprocess 3 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (((1 <= p14) AND (1 <= p145))) OR ((((p199 <= 0) OR (p217 <= 0)) R X (G (((p199 <= 0) OR (p217 <= 0))))) AND ((p199 <= 0) OR (p217 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p199 <= 0) OR (p217 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p199 <= 0) OR (p217 <= 0))
lola: processed formula length: 29
lola: 50 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 2 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 4 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((1 <= p14) AND (1 <= p145)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((1 <= p14) AND (1 <= p145)))
lola: processed formula length: 32
lola: 50 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: 260 markings, 260 edges
lola: ========================================
lola: subprocess 5 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p199 <= 0) OR (p217 <= 0)) R X (G (((p199 <= 0) OR (p217 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (((p199 <= 0) OR (p217 <= 0)) R X (G (((p199 <= 0) OR (p217 <= 0)))))
lola: processed formula length: 71
lola: 50 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: 260 markings, 260 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (G (((1 <= p42) AND (1 <= p52)))) AND X (G (((1 <= p201) AND (1 <= p210)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((1 <= p42) AND (1 <= p52))))
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 <= p42) AND (1 <= p52))))
lola: processed formula length: 35
lola: 50 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: 194 markings, 195 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 5 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((p113 <= 0) OR (p114 <= 0) OR (p122 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F (((p113 <= 0) OR (p114 <= 0) OR (p122 <= 0))))
lola: processed formula length: 53
lola: 50 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 164 markings, 164 edges
lola: ========================================
lola: subprocess 6 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((F (((1 <= p114) AND (1 <= p140))) OR ((1 <= p45) AND (1 <= p56)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((F (((1 <= p114) AND (1 <= p140))) OR ((1 <= p45) AND (1 <= p56)))))
lola: processed formula length: 74
lola: 50 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 859 markings, 1828 edges
lola: ========================================
lola: subprocess 7 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((G (((p45 <= 0) OR (p46 <= 0) OR (p51 <= 0))) OR (((p199 <= 0) OR (p200 <= 0) OR (p213 <= 0)) AND ((p45 <= 0) OR (p46 <= 0) OR (p51 <= 0))))) AND (G (F (((p204 <= 0) OR (p215 <= 0)))) AND ((p199 <= 0) OR (p200 <= 0) OR (p213 <= 0) OR (p45 <= 0) OR (p46 <= 0) OR (p51 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p199 <= 0) OR (p200 <= 0) OR (p213 <= 0) OR (p45 <= 0) OR (p46 <= 0) OR (p51 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p199 <= 0) OR (p200 <= 0) OR (p213 <= 0) OR (p45 <= 0) OR (p46 <= 0) OR (p51 <= 0))
lola: processed formula length: 90
lola: 50 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 6 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 8 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((p204 <= 0) OR (p215 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F (((p204 <= 0) OR (p215 <= 0))))
lola: processed formula length: 37
lola: 50 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 164 markings, 164 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: subprocess 8 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((F (G (((1 <= p39) AND (1 <= p41) AND (1 <= p58)))) AND ((1 <= p176))) OR (F ((F (G (((1 <= p39) AND (1 <= p41) AND (1 <= p58)))) AND ((1 <= p176)))) AND F (G (((1 <= p76) AND (1 <= p78) AND (1 <= p86))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p176))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p176))
lola: processed formula length: 13
lola: 50 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((F (G (((1 <= p39) AND (1 <= p41) AND (1 <= p58)))) AND ((1 <= p176))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((F (G (((1 <= p39) AND (1 <= p41) AND (1 <= p58)))) AND ((1 <= p176))))
lola: processed formula length: 74
lola: 50 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: 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: 193 markings, 193 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (F ((G (((p45 <= 0) OR (p46 <= 0) OR (p51 <= 0))) OR (((p199 <= 0) OR (p200 <= 0) OR (p213 <= 0)) AND ((p45 <= 0) OR (p46 <= 0) OR (p51 <= 0))))) AND (G (F (((p204 <= 0) OR (p215 <= 0)))) AND ((p199 <= 0) OR (p200 <= 0) OR (p213 <= 0) OR (p45 <= 0) OR (p46 <= 0) OR (p51 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: ((p199 <= 0) OR (p200 <= 0) OR (p213 <= 0) OR (p45 <= 0) OR (p46 <= 0) OR (p51 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p199 <= 0) OR (p200 <= 0) OR (p213 <= 0) OR (p45 <= 0) OR (p46 <= 0) OR (p51 <= 0))
lola: processed formula length: 90
lola: 50 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 6 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: G (F (((p204 <= 0) OR (p215 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F (((p204 <= 0) OR (p215 <= 0))))
lola: processed formula length: 37
lola: 50 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 164 markings, 164 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: F ((G (((p45 <= 0) OR (p46 <= 0) OR (p51 <= 0))) OR (((p199 <= 0) OR (p200 <= 0) OR (p213 <= 0)) AND ((p45 <= 0) OR (p46 <= 0) OR (p51 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((G (((p45 <= 0) OR (p46 <= 0) OR (p51 <= 0))) OR (((p199 <= 0) OR (p200 <= 0) OR (p213 <= 0)) AND ((p45 <= 0) OR (p46 <= 0) OR (p51 <= 0)))))
lola: processed formula length: 150
lola: 50 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes yes no no yes no no yes
lola:
preliminary result: no yes yes no no yes no no yes
lola: memory consumption: 37108 KB
lola: time consumption: 3 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLFireability.json
lola: closed JSON file LTLFireability.json
rslt: finished

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ParamProductionCell-PT-1"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2020"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool gold2020"
echo " Input is ParamProductionCell-PT-1, 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 r151-tall-162089151200186"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ParamProductionCell-PT-1.tgz
mv ParamProductionCell-PT-1 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 ;