fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r094-tall-162048902500205
Last Updated
Jun 28, 2021

About the Execution of 2020-gold for DoubleExponent-PT-003

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
4280.079 3600000.00 30093.00 440.20 TFFFTFTFFTFFFFFT normal

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.r094-tall-162048902500205.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 DoubleExponent-PT-003, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r094-tall-162048902500205
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 420K
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 136K May 10 09:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.8K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 70K May 10 09:42 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 3.2K Mar 28 16:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 16:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 23 10:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 23 10:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 22 18:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 22 18:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 09:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 50K 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 DoubleExponent-PT-003-00
FORMULA_NAME DoubleExponent-PT-003-01
FORMULA_NAME DoubleExponent-PT-003-02
FORMULA_NAME DoubleExponent-PT-003-03
FORMULA_NAME DoubleExponent-PT-003-04
FORMULA_NAME DoubleExponent-PT-003-05
FORMULA_NAME DoubleExponent-PT-003-06
FORMULA_NAME DoubleExponent-PT-003-07
FORMULA_NAME DoubleExponent-PT-003-08
FORMULA_NAME DoubleExponent-PT-003-09
FORMULA_NAME DoubleExponent-PT-003-10
FORMULA_NAME DoubleExponent-PT-003-11
FORMULA_NAME DoubleExponent-PT-003-12
FORMULA_NAME DoubleExponent-PT-003-13
FORMULA_NAME DoubleExponent-PT-003-14
FORMULA_NAME DoubleExponent-PT-003-15

=== Now, execution of the tool begins

BK_START 1620745914162

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-11 15:11:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2021-05-11 15:11:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-11 15:11:55] [INFO ] Load time of PNML (sax parser for PT used): 42 ms
[2021-05-11 15:11:55] [INFO ] Transformed 163 places.
[2021-05-11 15:11:55] [INFO ] Transformed 148 transitions.
[2021-05-11 15:11:55] [INFO ] Parsed PT model containing 163 places and 148 transitions in 78 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 31 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 3337 resets, run finished after 350 ms. (steps per millisecond=285 ) properties seen :[0, 1, 0, 1, 1, 1, 0, 0, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 1]
// Phase 1: matrix 148 rows 163 cols
[2021-05-11 15:11:56] [INFO ] Computed 19 place invariants in 11 ms
[2021-05-11 15:11:56] [INFO ] [Real]Absence check using 5 positive place invariants in 16 ms returned unsat
[2021-05-11 15:11:56] [INFO ] [Real]Absence check using 5 positive place invariants in 6 ms returned unsat
[2021-05-11 15:11:56] [INFO ] [Real]Absence check using 5 positive place invariants in 7 ms returned unsat
[2021-05-11 15:11:56] [INFO ] [Real]Absence check using 5 positive place invariants in 6 ms returned unsat
[2021-05-11 15:11:56] [INFO ] [Real]Absence check using 5 positive place invariants in 7 ms returned unsat
[2021-05-11 15:11:56] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned unsat
[2021-05-11 15:11:56] [INFO ] [Real]Absence check using 5 positive place invariants in 10 ms returned sat
[2021-05-11 15:11:56] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 6 ms returned sat
[2021-05-11 15:11:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 15:11:56] [INFO ] [Real]Absence check using state equation in 93 ms returned sat
[2021-05-11 15:11:56] [INFO ] Deduced a trap composed of 60 places in 85 ms
[2021-05-11 15:11:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 119 ms
[2021-05-11 15:11:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 15:11:56] [INFO ] [Nat]Absence check using 5 positive place invariants in 14 ms returned sat
[2021-05-11 15:11:56] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 5 ms returned sat
[2021-05-11 15:11:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 15:11:56] [INFO ] [Nat]Absence check using state equation in 96 ms returned sat
[2021-05-11 15:11:56] [INFO ] Deduced a trap composed of 60 places in 60 ms
[2021-05-11 15:11:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 78 ms
[2021-05-11 15:11:56] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints in 8 ms.
[2021-05-11 15:11:57] [INFO ] Added : 139 causal constraints over 28 iterations in 361 ms. Result :sat
[2021-05-11 15:11:57] [INFO ] [Real]Absence check using 5 positive place invariants in 7 ms returned sat
[2021-05-11 15:11:57] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 6 ms returned sat
[2021-05-11 15:11:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 15:11:57] [INFO ] [Real]Absence check using state equation in 97 ms returned sat
[2021-05-11 15:11:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 15:11:57] [INFO ] [Nat]Absence check using 5 positive place invariants in 12 ms returned sat
[2021-05-11 15:11:57] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 5 ms returned sat
[2021-05-11 15:11:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 15:11:57] [INFO ] [Nat]Absence check using state equation in 96 ms returned sat
[2021-05-11 15:11:57] [INFO ] Deduced a trap composed of 57 places in 41 ms
[2021-05-11 15:11:57] [INFO ] Deduced a trap composed of 29 places in 43 ms
[2021-05-11 15:11:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 104 ms
[2021-05-11 15:11:57] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints in 8 ms.
[2021-05-11 15:11:57] [INFO ] Added : 91 causal constraints over 19 iterations in 263 ms. Result :sat
[2021-05-11 15:11:57] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned unsat
[2021-05-11 15:11:58] [INFO ] [Real]Absence check using 5 positive place invariants in 6 ms returned unsat
[2021-05-11 15:11:58] [INFO ] [Real]Absence check using 5 positive place invariants in 6 ms returned unsat
[2021-05-11 15:11:58] [INFO ] [Real]Absence check using 5 positive place invariants in 7 ms returned sat
[2021-05-11 15:11:58] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 5 ms returned sat
[2021-05-11 15:11:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 15:11:58] [INFO ] [Real]Absence check using state equation in 86 ms returned sat
[2021-05-11 15:11:58] [INFO ] Deduced a trap composed of 18 places in 48 ms
[2021-05-11 15:11:58] [INFO ] Deduced a trap composed of 67 places in 45 ms
[2021-05-11 15:11:58] [INFO ] Deduced a trap composed of 62 places in 45 ms
[2021-05-11 15:11:58] [INFO ] Deduced a trap composed of 56 places in 46 ms
[2021-05-11 15:11:58] [INFO ] Deduced a trap composed of 31 places in 44 ms
[2021-05-11 15:11:58] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 271 ms
[2021-05-11 15:11:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 15:11:58] [INFO ] [Nat]Absence check using 5 positive place invariants in 13 ms returned sat
[2021-05-11 15:11:58] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 5 ms returned sat
[2021-05-11 15:11:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 15:11:58] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2021-05-11 15:11:58] [INFO ] Deduced a trap composed of 18 places in 50 ms
[2021-05-11 15:11:58] [INFO ] Deduced a trap composed of 67 places in 45 ms
[2021-05-11 15:11:58] [INFO ] Deduced a trap composed of 56 places in 44 ms
[2021-05-11 15:11:58] [INFO ] Deduced a trap composed of 31 places in 50 ms
[2021-05-11 15:11:58] [INFO ] Deduced a trap composed of 16 places in 43 ms
[2021-05-11 15:11:58] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 273 ms
[2021-05-11 15:11:58] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints in 7 ms.
[2021-05-11 15:11:59] [INFO ] Added : 93 causal constraints over 19 iterations in 275 ms. Result :sat
[2021-05-11 15:11:59] [INFO ] Deduced a trap composed of 73 places in 46 ms
[2021-05-11 15:11:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 98 ms
[2021-05-11 15:11:59] [INFO ] [Real]Absence check using 5 positive place invariants in 7 ms returned sat
[2021-05-11 15:11:59] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 6 ms returned sat
[2021-05-11 15:11:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 15:11:59] [INFO ] [Real]Absence check using state equation in 97 ms returned sat
[2021-05-11 15:11:59] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 15:11:59] [INFO ] [Nat]Absence check using 5 positive place invariants in 13 ms returned sat
[2021-05-11 15:11:59] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 9 ms returned sat
[2021-05-11 15:11:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 15:11:59] [INFO ] [Nat]Absence check using state equation in 93 ms returned sat
[2021-05-11 15:11:59] [INFO ] Deduced a trap composed of 67 places in 44 ms
[2021-05-11 15:11:59] [INFO ] Deduced a trap composed of 64 places in 43 ms
[2021-05-11 15:11:59] [INFO ] Deduced a trap composed of 31 places in 53 ms
[2021-05-11 15:11:59] [INFO ] Deduced a trap composed of 65 places in 47 ms
[2021-05-11 15:11:59] [INFO ] Deduced a trap composed of 53 places in 42 ms
[2021-05-11 15:11:59] [INFO ] Deduced a trap composed of 67 places in 47 ms
[2021-05-11 15:11:59] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 336 ms
[2021-05-11 15:11:59] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints in 7 ms.
[2021-05-11 15:12:00] [INFO ] Added : 144 causal constraints over 29 iterations in 316 ms. Result :sat
[2021-05-11 15:12:00] [INFO ] [Real]Absence check using 5 positive place invariants in 6 ms returned unsat
[2021-05-11 15:12:00] [INFO ] [Real]Absence check using 5 positive place invariants in 6 ms returned sat
[2021-05-11 15:12:00] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 5 ms returned sat
[2021-05-11 15:12:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 15:12:00] [INFO ] [Real]Absence check using state equation in 97 ms returned sat
[2021-05-11 15:12:00] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 15:12:00] [INFO ] [Nat]Absence check using 5 positive place invariants in 12 ms returned sat
[2021-05-11 15:12:00] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 5 ms returned sat
[2021-05-11 15:12:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 15:12:00] [INFO ] [Nat]Absence check using state equation in 90 ms returned sat
[2021-05-11 15:12:00] [INFO ] Deduced a trap composed of 18 places in 37 ms
[2021-05-11 15:12:00] [INFO ] Deduced a trap composed of 42 places in 33 ms
[2021-05-11 15:12:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 87 ms
[2021-05-11 15:12:00] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints in 7 ms.
[2021-05-11 15:12:00] [INFO ] Added : 143 causal constraints over 30 iterations in 367 ms. Result :sat
[2021-05-11 15:12:00] [INFO ] [Real]Absence check using 5 positive place invariants in 8 ms returned sat
[2021-05-11 15:12:00] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 6 ms returned sat
[2021-05-11 15:12:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 15:12:00] [INFO ] [Real]Absence check using state equation in 98 ms returned sat
[2021-05-11 15:12:00] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 15:12:01] [INFO ] [Nat]Absence check using 5 positive place invariants in 13 ms returned sat
[2021-05-11 15:12:01] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 6 ms returned sat
[2021-05-11 15:12:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 15:12:01] [INFO ] [Nat]Absence check using state equation in 93 ms returned sat
[2021-05-11 15:12:01] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints in 7 ms.
[2021-05-11 15:12:01] [INFO ] Added : 109 causal constraints over 22 iterations in 287 ms. Result :sat
[2021-05-11 15:12:01] [INFO ] [Real]Absence check using 5 positive place invariants in 7 ms returned sat
[2021-05-11 15:12:01] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 6 ms returned sat
[2021-05-11 15:12:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 15:12:01] [INFO ] [Real]Absence check using state equation in 101 ms returned sat
[2021-05-11 15:12:01] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 15:12:01] [INFO ] [Nat]Absence check using 5 positive place invariants in 12 ms returned sat
[2021-05-11 15:12:01] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 5 ms returned sat
[2021-05-11 15:12:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 15:12:01] [INFO ] [Nat]Absence check using state equation in 92 ms returned sat
[2021-05-11 15:12:01] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints in 8 ms.
[2021-05-11 15:12:02] [INFO ] Added : 144 causal constraints over 29 iterations in 328 ms. Result :sat
[2021-05-11 15:12:02] [INFO ] [Real]Absence check using 5 positive place invariants in 7 ms returned sat
[2021-05-11 15:12:02] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 6 ms returned sat
[2021-05-11 15:12:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 15:12:02] [INFO ] [Real]Absence check using state equation in 95 ms returned sat
[2021-05-11 15:12:02] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 15:12:02] [INFO ] [Nat]Absence check using 5 positive place invariants in 12 ms returned sat
[2021-05-11 15:12:02] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 5 ms returned sat
[2021-05-11 15:12:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 15:12:02] [INFO ] [Nat]Absence check using state equation in 93 ms returned sat
[2021-05-11 15:12:02] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints in 6 ms.
[2021-05-11 15:12:02] [INFO ] Added : 109 causal constraints over 22 iterations in 287 ms. Result :sat
[2021-05-11 15:12:02] [INFO ] [Real]Absence check using 5 positive place invariants in 7 ms returned sat
[2021-05-11 15:12:02] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 6 ms returned sat
[2021-05-11 15:12:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 15:12:02] [INFO ] [Real]Absence check using state equation in 94 ms returned sat
[2021-05-11 15:12:02] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 15:12:02] [INFO ] [Nat]Absence check using 5 positive place invariants in 13 ms returned sat
[2021-05-11 15:12:02] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 6 ms returned sat
[2021-05-11 15:12:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 15:12:02] [INFO ] [Nat]Absence check using state equation in 89 ms returned sat
[2021-05-11 15:12:02] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints in 8 ms.
[2021-05-11 15:12:03] [INFO ] Added : 143 causal constraints over 30 iterations in 341 ms. Result :sat
[2021-05-11 15:12:03] [INFO ] [Real]Absence check using 5 positive place invariants in 7 ms returned sat
[2021-05-11 15:12:03] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 6 ms returned sat
[2021-05-11 15:12:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 15:12:03] [INFO ] [Real]Absence check using state equation in 91 ms returned sat
[2021-05-11 15:12:03] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints in 6 ms.
[2021-05-11 15:12:03] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 15:12:03] [INFO ] [Nat]Absence check using 5 positive place invariants in 12 ms returned sat
[2021-05-11 15:12:03] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 6 ms returned sat
[2021-05-11 15:12:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 15:12:03] [INFO ] [Nat]Absence check using state equation in 90 ms returned sat
[2021-05-11 15:12:03] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints in 7 ms.
[2021-05-11 15:12:03] [INFO ] Added : 145 causal constraints over 29 iterations in 330 ms. Result :sat
[2021-05-11 15:12:03] [INFO ] [Real]Absence check using 5 positive place invariants in 7 ms returned sat
[2021-05-11 15:12:03] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 5 ms returned sat
[2021-05-11 15:12:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 15:12:03] [INFO ] [Real]Absence check using state equation in 83 ms returned sat
[2021-05-11 15:12:03] [INFO ] Deduced a trap composed of 65 places in 44 ms
[2021-05-11 15:12:04] [INFO ] Deduced a trap composed of 57 places in 39 ms
[2021-05-11 15:12:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 103 ms
[2021-05-11 15:12:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 15:12:04] [INFO ] [Nat]Absence check using 5 positive place invariants in 12 ms returned sat
[2021-05-11 15:12:04] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 5 ms returned sat
[2021-05-11 15:12:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 15:12:04] [INFO ] [Nat]Absence check using state equation in 87 ms returned sat
[2021-05-11 15:12:04] [INFO ] Deduced a trap composed of 65 places in 43 ms
[2021-05-11 15:12:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 60 ms
[2021-05-11 15:12:04] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints in 11 ms.
[2021-05-11 15:12:04] [INFO ] Added : 138 causal constraints over 28 iterations in 303 ms. Result :sat
[2021-05-11 15:12:04] [INFO ] [Real]Absence check using 5 positive place invariants in 6 ms returned unsat
[2021-05-11 15:12:04] [INFO ] [Real]Absence check using 5 positive place invariants in 7 ms returned sat
[2021-05-11 15:12:04] [INFO ] [Real]Absence check using 5 positive and 14 generalized place invariants in 6 ms returned sat
[2021-05-11 15:12:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 15:12:04] [INFO ] [Real]Absence check using state equation in 95 ms returned sat
[2021-05-11 15:12:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 15:12:04] [INFO ] [Nat]Absence check using 5 positive place invariants in 12 ms returned sat
[2021-05-11 15:12:04] [INFO ] [Nat]Absence check using 5 positive and 14 generalized place invariants in 6 ms returned sat
[2021-05-11 15:12:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 15:12:04] [INFO ] [Nat]Absence check using state equation in 92 ms returned sat
[2021-05-11 15:12:04] [INFO ] Deduced a trap composed of 60 places in 45 ms
[2021-05-11 15:12:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 55 ms
[2021-05-11 15:12:04] [INFO ] Computed and/alt/rep : 147/284/147 causal constraints in 8 ms.
[2021-05-11 15:12:05] [INFO ] Added : 143 causal constraints over 30 iterations in 341 ms. Result :sat
Successfully simplified 11 atomic propositions for a total of 16 simplifications.
[2021-05-11 15:12:05] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2021-05-11 15:12:05] [INFO ] Flatten gal took : 44 ms
FORMULA DoubleExponent-PT-003-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-003-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-003-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-003-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-003-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-11 15:12:05] [INFO ] Flatten gal took : 13 ms
[2021-05-11 15:12:05] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2021-05-11 15:12:05] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 2 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ DoubleExponent-PT-003 @ 3570 seconds

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

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

FORMULA DoubleExponent-PT-003-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA DoubleExponent-PT-003-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DoubleExponent-PT-003-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DoubleExponent-PT-003-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DoubleExponent-PT-003-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DoubleExponent-PT-003-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA DoubleExponent-PT-003-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3561
rslt: Output for LTLCardinality @ DoubleExponent-PT-003

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 1,
"aneg": 2,
"comp": 2,
"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": "X (X ((F (((p89 <= p10))) AND G ((p5 + 1 <= p124)))))",
"processed_size": 53,
"rewrites": 45
},
"result":
{
"edges": 25,
"markings": 25,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"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": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "G ((X (((p22 + 1 <= p1))) OR (1 <= p4)))",
"processed_size": 40,
"rewrites": 45
},
"result":
{
"edges": 25,
"markings": 25,
"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"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (F ((p7 <= p114)))",
"processed_size": 20,
"rewrites": 45
},
"result":
{
"edges": 1,
"markings": 2,
"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": 446
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 1,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 5,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 2,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (F ((F ((p133 <= p97)) AND F ((G ((p24 + 1 <= p155)) OR ((p24 + 1 <= p155) AND X (((p97 + 1 <= p133) R (p24 + 1 <= p155)))))))))",
"processed_size": 130,
"rewrites": 45
},
"result":
{
"edges": 25,
"markings": 25,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 13
},
"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": 509
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(p47 + 1 <= p44)",
"processed_size": 16,
"rewrites": 45
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 4,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "X (G ((1 <= p105)))",
"processed_size": 19,
"rewrites": 45
},
"result":
{
"edges": 25,
"markings": 25,
"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": 4,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "X (X (F ((1 <= p125))))",
"processed_size": 23,
"rewrites": 45
},
"result":
{
"edges": 25,
"markings": 25,
"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"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "X (G ((2 <= p69)))",
"processed_size": 18,
"rewrites": 45
},
"result":
{
"edges": 25,
"markings": 25,
"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": 892
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 2,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (F ((F ((G ((p162 <= p79)) OR (p162 <= p79))) AND G (F ((p162 <= p79))))))",
"processed_size": 76,
"rewrites": 45
},
"result":
{
"edges": 2935835,
"markings": 2681664,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 10
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1187
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "F (G ((p153 + 1 <= p40)))",
"processed_size": 25,
"rewrites": 45
},
"result":
{
"edges": 31,
"markings": 30,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 8,
"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": 1780
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "F (G ((p141 <= p106)))",
"processed_size": 22,
"rewrites": 45
},
"result":
{
"edges": 31,
"markings": 30,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3561
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "G ((p118 <= 2))",
"processed_size": 15,
"rewrites": 45
},
"result":
{
"edges": 332,
"markings": 309,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"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": 10,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 22820,
"runtime": 9.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "F(G(**)) : X(X((F(*) AND G(*)))) : G((X(**) OR **)) : X(F(**)) : (G(*) AND F(**)) : X(F((F(*) AND F((G(*) OR (* AND X((* R *)))))))) : (X(G(**)) OR **) : X(X(F(**))) : X(G(*)) : F(G(*)) : X(F((F((G(**) OR **)) AND G(F(**)))))"
},
"net":
{
"arcs": 417,
"conflict_clusters": 109,
"places": 163,
"places_significant": 144,
"singleton_clusters": 0,
"transitions": 148
},
"result":
{
"preliminary_value": "no no no yes no no no no no no yes ",
"value": "no no no yes no no no no 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: 311/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 5216
lola: finding significant places
lola: 163 places, 148 transitions, 144 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from LTLCardinality.xml
lola: F (G (X ((p141 <= p106)))) : X ((X (NOT(G (((p10 + 1 <= p89))))) AND G (NOT(X ((p124 <= p5)))))) : G ((X (((p22 + 1 <= p1))) OR (1 <= p4))) : F (X ((p7 <= p114))) : (NOT(F ((3 <= p118))) AND F ((p69 <= p2))) : X (NOT(G ((G ((p97 + 1 <= p133)) OR G (((p155 <= p24) U X (((p133 <= p97) U (p155 <= p24))))))))) : (X (G ((1 <= p105))) OR (p47 + 1 <= p44)) : F (((((1 <= p84) U (p71 <= 1)) OR (1 <= p84)) U X (X ((1 <= p125))))) : NOT(X (F ((p69 <= 1)))) : X (F (X (NOT((((p139 + 1 <= p74) AND (p160 + 1 <= p152)) U F ((p40 <= p153))))))) : F (X ((F ((G ((p162 <= p79)) OR (p162 <= p79))) AND G (F ((p162 <= p79))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:434
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: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
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:422
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:356
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X ((F (((p89 <= p10))) AND G ((p5 + 1 <= p124)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X ((F (((p89 <= p10))) AND G ((p5 + 1 <= p124)))))
lola: processed formula length: 53
lola: 45 rewrites
lola: closed formula file LTLCardinality.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: 25 markings, 25 edges
lola: ========================================
lola: subprocess 1 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((X (((p22 + 1 <= p1))) OR (1 <= p4)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((X (((p22 + 1 <= p1))) OR (1 <= p4)))
lola: processed formula length: 40
lola: 45 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 25 markings, 25 edges
lola: ========================================
lola: subprocess 2 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((p7 <= p114)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((p7 <= p114)))
lola: processed formula length: 20
lola: 45 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 3 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((F ((p133 <= p97)) AND F ((G ((p24 + 1 <= p155)) OR ((p24 + 1 <= p155) AND X (((p97 + 1 <= p133) R (p24 + 1 <= p155)))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((F ((p133 <= p97)) AND F ((G ((p24 + 1 <= p155)) OR ((p24 + 1 <= p155) AND X (((p97 + 1 <= p133) R (p24 + 1 <= p155)))))))))
lola: processed formula length: 130
lola: 45 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 13 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: 25 markings, 25 edges
lola: ========================================
lola: subprocess 4 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (G ((1 <= p105))) OR (p47 + 1 <= p44))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p47 + 1 <= p44)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p47 + 1 <= p44)
lola: processed formula length: 16
lola: 45 rewrites
lola: closed formula file LTLCardinality.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: subprocess 5 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((1 <= p105)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((1 <= p105)))
lola: processed formula length: 19
lola: 45 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 25 markings, 25 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 5 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (F ((1 <= p125))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (F ((1 <= p125))))
lola: processed formula length: 23
lola: 45 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 25 markings, 25 edges
lola: ========================================
lola: subprocess 6 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((2 <= p69)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((2 <= p69)))
lola: processed formula length: 18
lola: 45 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 25 markings, 25 edges
lola: ========================================
lola: subprocess 7 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((F ((G ((p162 <= p79)) OR (p162 <= p79))) AND G (F ((p162 <= p79))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((F ((G ((p162 <= p79)) OR (p162 <= p79))) AND G (F ((p162 <= p79))))))
lola: processed formula length: 76
lola: 45 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 10 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: 2191980 markings, 2399167 edges, 438396 markings/sec, 0 secs
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: 2681664 markings, 2935835 edges
lola: ========================================
lola: subprocess 8 will run for 1187 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((p153 + 1 <= p40)))
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 ((p153 + 1 <= p40)))
lola: processed formula length: 25
lola: 45 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 30 markings, 31 edges
lola: ========================================
lola: subprocess 9 will run for 1780 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((p141 <= p106)))
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 ((p141 <= p106)))
lola: processed formula length: 22
lola: 45 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 30 markings, 31 edges
lola: ========================================
lola: subprocess 10 will run for 3561 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G ((p118 <= 2)) AND F ((p69 <= p2)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 3561 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((p118 <= 2))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p118 <= 2))
lola: processed formula length: 15
lola: 45 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 309 markings, 332 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no yes no no no no no no yes
lola:
preliminary result: no no no yes no no no no no no yes
lola: memory consumption: 22820 KB
lola: time consumption: 9 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
rslt: finished

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool gold2020"
echo " Input is DoubleExponent-PT-003, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r094-tall-162048902500205"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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