Execution Chart

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

Trace from the execution

Formatting '/local/x2003239/mcc2020-input.r174-csrt-158987853200457.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2020-input.qcow2 encryption=off cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is PaceMaker-PT-none, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r174-csrt-158987853200457
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 336K
-rw-r--r-- 1 mcc users 3.7K Apr 8 15:24 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Apr 8 15:24 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 7 18:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 7 18:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.5K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 14 12:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 14 12:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 6 20:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Apr 6 20:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.5K Apr 6 04:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 6 04:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 6 20:25 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 6 20:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 158K Mar 24 05:37 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1591149262712

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 01:54:24] [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]
[2020-06-03 01:54:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 01:54:25] [INFO ] Load time of PNML (sax parser for PT used): 89 ms
[2020-06-03 01:54:25] [INFO ] Transformed 70 places.
[2020-06-03 01:54:25] [INFO ] Transformed 164 transitions.
[2020-06-03 01:54:25] [INFO ] Parsed PT model containing 70 places and 164 transitions in 141 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 414 ms. (steps per millisecond=241 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 1, 0, 0, 0]
[2020-06-03 01:54:25] [INFO ] Flow matrix only has 158 transitions (discarded 6 similar events)
Normalized transition count is 93 out of 158 initially.
// Phase 1: matrix 93 rows 70 cols
[2020-06-03 01:54:25] [INFO ] Computed 35 place invariants in 10 ms
[2020-06-03 01:54:25] [INFO ] [Real]Absence check using 35 positive place invariants in 51 ms returned sat
[2020-06-03 01:54:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 01:54:25] [INFO ] [Real]Absence check using state equation in 99 ms returned sat
[2020-06-03 01:54:25] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 01:54:25] [INFO ] [Nat]Absence check using 35 positive place invariants in 20 ms returned sat
[2020-06-03 01:54:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 01:54:31] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 01:54:34] [INFO ] [Nat]Absence check using state equation in 9061 ms returned unknown
[2020-06-03 01:54:35] [INFO ] [Real]Absence check using 35 positive place invariants in 49 ms returned unsat
[2020-06-03 01:54:35] [INFO ] [Real]Absence check using 35 positive place invariants in 19 ms returned sat
[2020-06-03 01:54:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 01:54:35] [INFO ] [Real]Absence check using state equation in 97 ms returned sat
[2020-06-03 01:54:35] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 01:54:35] [INFO ] [Nat]Absence check using 35 positive place invariants in 13 ms returned sat
[2020-06-03 01:54:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 01:54:41] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 01:54:44] [INFO ] [Nat]Absence check using state equation in 9140 ms returned unknown
[2020-06-03 01:54:44] [INFO ] [Real]Absence check using 35 positive place invariants in 19 ms returned sat
[2020-06-03 01:54:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 01:54:44] [INFO ] [Real]Absence check using state equation in 143 ms returned sat
[2020-06-03 01:54:44] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 01:54:44] [INFO ] [Nat]Absence check using 35 positive place invariants in 11 ms returned sat
[2020-06-03 01:54:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 01:54:50] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 01:54:53] [INFO ] [Nat]Absence check using state equation in 9073 ms returned unknown
[2020-06-03 01:54:53] [INFO ] [Real]Absence check using 35 positive place invariants in 25 ms returned sat
[2020-06-03 01:54:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 01:54:53] [INFO ] [Real]Absence check using state equation in 117 ms returned sat
[2020-06-03 01:54:53] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 01:54:54] [INFO ] [Nat]Absence check using 35 positive place invariants in 23 ms returned sat
[2020-06-03 01:54:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 01:55:00] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 01:55:03] [INFO ] [Nat]Absence check using state equation in 9156 ms returned unknown
[2020-06-03 01:55:03] [INFO ] [Real]Absence check using 35 positive place invariants in 19 ms returned sat
[2020-06-03 01:55:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 01:55:03] [INFO ] [Real]Absence check using state equation in 106 ms returned sat
[2020-06-03 01:55:03] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 01:55:03] [INFO ] [Nat]Absence check using 35 positive place invariants in 81 ms returned sat
[2020-06-03 01:55:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 01:55:09] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 01:55:12] [INFO ] [Nat]Absence check using state equation in 9321 ms returned unknown
[2020-06-03 01:55:12] [INFO ] [Real]Absence check using 35 positive place invariants in 12 ms returned sat
[2020-06-03 01:55:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 01:55:12] [INFO ] [Real]Absence check using state equation in 91 ms returned sat
[2020-06-03 01:55:12] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 01:55:12] [INFO ] [Nat]Absence check using 35 positive place invariants in 15 ms returned sat
[2020-06-03 01:55:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 01:55:18] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 01:55:21] [INFO ] [Nat]Absence check using state equation in 9052 ms returned unknown
[2020-06-03 01:55:22] [INFO ] [Real]Absence check using 35 positive place invariants in 48 ms returned unsat
[2020-06-03 01:55:22] [INFO ] [Real]Absence check using 35 positive place invariants in 69 ms returned sat
[2020-06-03 01:55:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 01:55:22] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2020-06-03 01:55:22] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 01:55:22] [INFO ] [Nat]Absence check using 35 positive place invariants in 9 ms returned sat
[2020-06-03 01:55:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 01:55:28] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 01:55:31] [INFO ] [Nat]Absence check using state equation in 9177 ms returned unknown
[2020-06-03 01:55:31] [INFO ] [Real]Absence check using 35 positive place invariants in 25 ms returned sat
[2020-06-03 01:55:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 01:55:31] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2020-06-03 01:55:31] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 01:55:31] [INFO ] [Nat]Absence check using 35 positive place invariants in 10 ms returned sat
[2020-06-03 01:55:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 01:55:37] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 01:55:40] [INFO ] [Nat]Absence check using state equation in 9202 ms returned unknown
[2020-06-03 01:55:40] [INFO ] [Real]Absence check using 35 positive place invariants in 23 ms returned sat
[2020-06-03 01:55:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 01:55:40] [INFO ] [Real]Absence check using state equation in 94 ms returned sat
[2020-06-03 01:55:40] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 01:55:41] [INFO ] [Nat]Absence check using 35 positive place invariants in 23 ms returned sat
[2020-06-03 01:55:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 01:55:47] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 01:55:50] [INFO ] [Nat]Absence check using state equation in 9261 ms returned unknown
[2020-06-03 01:55:50] [INFO ] [Real]Absence check using 35 positive place invariants in 14 ms returned sat
[2020-06-03 01:55:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 01:55:50] [INFO ] [Real]Absence check using state equation in 81 ms returned sat
[2020-06-03 01:55:50] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 01:55:50] [INFO ] [Nat]Absence check using 35 positive place invariants in 22 ms returned sat
[2020-06-03 01:55:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 01:55:56] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 01:55:59] [INFO ] [Nat]Absence check using state equation in 9072 ms returned unknown
[2020-06-03 01:55:59] [INFO ] [Real]Absence check using 35 positive place invariants in 29 ms returned sat
[2020-06-03 01:55:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 01:55:59] [INFO ] [Real]Absence check using state equation in 90 ms returned sat
[2020-06-03 01:55:59] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 01:55:59] [INFO ] [Nat]Absence check using 35 positive place invariants in 17 ms returned sat
[2020-06-03 01:55:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 01:56:05] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 01:56:08] [INFO ] [Nat]Absence check using state equation in 9093 ms returned unknown
[2020-06-03 01:56:08] [INFO ] [Real]Absence check using 35 positive place invariants in 16 ms returned sat
[2020-06-03 01:56:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 01:56:08] [INFO ] [Real]Absence check using state equation in 96 ms returned sat
[2020-06-03 01:56:08] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 01:56:09] [INFO ] [Nat]Absence check using 35 positive place invariants in 18 ms returned sat
[2020-06-03 01:56:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 01:56:15] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 01:56:18] [INFO ] [Nat]Absence check using state equation in 9051 ms returned unknown
[2020-06-03 01:56:18] [INFO ] [Real]Absence check using 35 positive place invariants in 15 ms returned sat
[2020-06-03 01:56:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 01:56:18] [INFO ] [Real]Absence check using state equation in 71 ms returned sat
[2020-06-03 01:56:18] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 01:56:18] [INFO ] [Nat]Absence check using 35 positive place invariants in 15 ms returned sat
[2020-06-03 01:56:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 01:56:24] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 01:56:28] [INFO ] [Nat]Absence check using state equation in 9869 ms returned unknown
[2020-06-03 01:56:28] [INFO ] [Real]Absence check using 35 positive place invariants in 9 ms returned unsat
[2020-06-03 01:56:28] [INFO ] [Real]Absence check using 35 positive place invariants in 3 ms returned unsat
[2020-06-03 01:56:28] [INFO ] [Real]Absence check using 35 positive place invariants in 8 ms returned unsat
[2020-06-03 01:56:28] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned unsat
[2020-06-03 01:56:28] [INFO ] [Real]Absence check using 35 positive place invariants in 116 ms returned unsat
[2020-06-03 01:56:28] [INFO ] [Real]Absence check using 35 positive place invariants in 8 ms returned sat
[2020-06-03 01:56:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 01:56:28] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2020-06-03 01:56:28] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 01:56:28] [INFO ] [Nat]Absence check using 35 positive place invariants in 15 ms returned sat
[2020-06-03 01:56:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 01:56:34] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 01:56:37] [INFO ] [Nat]Absence check using state equation in 9496 ms returned unknown
[2020-06-03 01:56:37] [INFO ] [Real]Absence check using 35 positive place invariants in 3 ms returned unsat
[2020-06-03 01:56:38] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned unsat
[2020-06-03 01:56:38] [INFO ] [Real]Absence check using 35 positive place invariants in 7 ms returned unsat
[2020-06-03 01:56:38] [INFO ] [Real]Absence check using 35 positive place invariants in 11 ms returned unsat
[2020-06-03 01:56:38] [INFO ] [Real]Absence check using 35 positive place invariants in 18 ms returned sat
[2020-06-03 01:56:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 01:56:38] [INFO ] [Real]Absence check using state equation in 71 ms returned sat
[2020-06-03 01:56:38] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 01:56:38] [INFO ] [Nat]Absence check using 35 positive place invariants in 19 ms returned sat
[2020-06-03 01:56:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 01:56:44] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 01:56:47] [INFO ] [Nat]Absence check using state equation in 9070 ms returned unknown
[2020-06-03 01:56:47] [INFO ] [Real]Absence check using 35 positive place invariants in 3 ms returned unsat
[2020-06-03 01:56:47] [INFO ] [Real]Absence check using 35 positive place invariants in 16 ms returned sat
[2020-06-03 01:56:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 01:56:47] [INFO ] [Real]Absence check using state equation in 82 ms returned sat
[2020-06-03 01:56:47] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 01:56:47] [INFO ] [Nat]Absence check using 35 positive place invariants in 16 ms returned sat
[2020-06-03 01:56:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 01:56:53] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 01:56:56] [INFO ] [Nat]Absence check using state equation in 9106 ms returned unknown
[2020-06-03 01:56:56] [INFO ] [Real]Absence check using 35 positive place invariants in 15 ms returned sat
[2020-06-03 01:56:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 01:56:56] [INFO ] [Real]Absence check using state equation in 87 ms returned sat
[2020-06-03 01:56:56] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 01:56:56] [INFO ] [Nat]Absence check using 35 positive place invariants in 26 ms returned sat
[2020-06-03 01:56:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 01:57:02] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 01:57:05] [INFO ] [Nat]Absence check using state equation in 9113 ms returned unknown
[2020-06-03 01:57:05] [INFO ] [Real]Absence check using 35 positive place invariants in 12 ms returned unsat
[2020-06-03 01:57:05] [INFO ] [Real]Absence check using 35 positive place invariants in 8 ms returned unsat
[2020-06-03 01:57:06] [INFO ] [Real]Absence check using 35 positive place invariants in 20 ms returned sat
[2020-06-03 01:57:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 01:57:06] [INFO ] [Real]Absence check using state equation in 82 ms returned sat
[2020-06-03 01:57:06] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 01:57:06] [INFO ] [Nat]Absence check using 35 positive place invariants in 16 ms returned sat
[2020-06-03 01:57:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 01:57:12] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 01:57:15] [INFO ] [Nat]Absence check using state equation in 9314 ms returned unknown
[2020-06-03 01:57:15] [INFO ] [Real]Absence check using 35 positive place invariants in 18 ms returned sat
[2020-06-03 01:57:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 01:57:15] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2020-06-03 01:57:15] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 01:57:15] [INFO ] [Nat]Absence check using 35 positive place invariants in 13 ms returned sat
[2020-06-03 01:57:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 01:57:21] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 01:57:24] [INFO ] [Nat]Absence check using state equation in 9095 ms returned unknown
[2020-06-03 01:57:24] [INFO ] [Real]Absence check using 35 positive place invariants in 18 ms returned sat
[2020-06-03 01:57:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 01:57:24] [INFO ] [Real]Absence check using state equation in 97 ms returned sat
[2020-06-03 01:57:24] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 01:57:24] [INFO ] [Nat]Absence check using 35 positive place invariants in 16 ms returned sat
[2020-06-03 01:57:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 01:57:31] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 01:57:34] [INFO ] [Nat]Absence check using state equation in 9249 ms returned unknown
[2020-06-03 01:57:34] [INFO ] [Real]Absence check using 35 positive place invariants in 15 ms returned sat
[2020-06-03 01:57:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 01:57:34] [INFO ] [Real]Absence check using state equation in 75 ms returned sat
[2020-06-03 01:57:34] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 01:57:34] [INFO ] [Nat]Absence check using 35 positive place invariants in 11 ms returned sat
[2020-06-03 01:57:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 01:57:40] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 01:57:43] [INFO ] [Nat]Absence check using state equation in 9198 ms returned unknown
Successfully simplified 14 atomic propositions for a total of 17 simplifications.
[2020-06-03 01:57:43] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2020-06-03 01:57:43] [INFO ] Flatten gal took : 70 ms
FORMULA PaceMaker-PT-none-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PaceMaker-PT-none-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PaceMaker-PT-none-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PaceMaker-PT-none-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PaceMaker-PT-none-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PaceMaker-PT-none-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 01:57:43] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-06-03 01:57:43] [INFO ] Flatten gal took : 32 ms
[2020-06-03 01:57:43] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA PaceMaker-PT-none-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 01:57:43] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2020-06-03 01:57:43] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 5 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ PaceMaker-PT-none @ 3570 seconds

FORMULA PaceMaker-PT-none-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PaceMaker-PT-none-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PaceMaker-PT-none-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PaceMaker-PT-none-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PaceMaker-PT-none-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PaceMaker-PT-none-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PaceMaker-PT-none-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PaceMaker-PT-none-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PaceMaker-PT-none-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3565
rslt: Output for LTLCardinality @ PaceMaker-PT-none

{
"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": "Wed Jun 3 01:57:44 2020
",
"timelimit": 3570
},
"child":
[

{
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "X (F ((3 <= p65)))",
"processed_size": 18,
"rewrites": 32
},
"result":
{
"edges": 11,
"markings": 12,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"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": 3,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"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": "F (G ((F ((p17 <= p42)) AND X (F ((p25 <= p0))))))",
"processed_size": 50,
"rewrites": 32
},
"result":
{
"edges": 8,
"markings": 7,
"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": 509
},
"child":
[

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 1,
"X": 3,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "((X (X ((p27 + 1 <= p46))) OR G ((p28 + 1 <= p29))) U X ((p40 <= p4)))",
"processed_size": 70,
"rewrites": 32
},
"result":
{
"edges": 5,
"markings": 5,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"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": 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": "(p64 <= p29)",
"processed_size": 12,
"rewrites": 34
},
"result":
{
"edges": 11,
"markings": 11,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 6
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1188
},
"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 ((p23 + 1 <= p15)))",
"processed_size": 24,
"rewrites": 32
},
"result":
{
"edges": 10,
"markings": 9,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 6,
"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": 1782
},
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G ((p18 + 1 <= p63))",
"processed_size": 20,
"rewrites": 32
},
"result":
{
"edges": 22,
"markings": 21,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3565
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "F (G ((F ((p20 <= p39)) AND (2 <= p31))))",
"processed_size": 41,
"rewrites": 32
},
"result":
{
"edges": 12,
"markings": 11,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 21008,
"runtime": 5.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X(F(**)) : F(G((F(**) AND X(F(**))))) : F(G((F(**) AND **))) : (X(TRUE) AND (X((F(**) OR **)) U **)) : G(*) : X(X(X(G(*)))) : F(G(*)) : F(*) : ((X(X(**)) OR G(**)) U X(**))"
},
"net":
{
"arcs": 954,
"conflict_clusters": 6,
"places": 70,
"places_significant": 35,
"singleton_clusters": 0,
"transitions": 164
},
"result":
{
"preliminary_value": "yes no no yes no no no no no ",
"value": "yes no no yes no no no no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 234/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 2240
lola: finding significant places
lola: 70 places, 164 transitions, 35 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: LP says that atomic proposition is always false: (p69 <= p47)
lola: X (F ((3 <= p65))) : F (G ((F ((F ((p25 <= p0)) U (p17 <= p42))) AND F (X ((p25 <= p0)))))) : X (F (((p20 <= p39) U G ((F ((p20 <= p39)) AND (2 <= p31)))))) : (F (X (G (()))) AND (X ((F ((2 <= p63)) OR (p13 <= p58))) U (2 <= p63))) : NOT(F ((p63 <= p18))) : G (X (X (G (X (NOT(F (((0 <= 0) U (p48 <= 0))))))))) : G (F (X (NOT(F ((p15 <= p23)))))) : NOT(G ((p64 <= p29))) : ((((1 <= 0) U X (X (((1 <= 0) U (p27 + 1 <= p46))))) OR G ((p28 + 1 <= p29))) U X ((p40 <= p4)))
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:347
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:350
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
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:374
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:185
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 (F ((3 <= p65)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((3 <= p65)))
lola: processed formula length: 18
lola: 32 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: 12 markings, 11 edges
lola: ========================================
lola: subprocess 1 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F ((p17 <= p42)) AND X (F ((p25 <= p0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F ((p17 <= p42)) AND X (F ((p25 <= p0))))))
lola: processed formula length: 50
lola: 32 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: 7 markings, 8 edges
lola: ========================================
lola: subprocess 2 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (TRUE) AND (X ((F ((2 <= p63)) OR (p13 <= p58))) U (2 <= p63)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (TRUE)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (TRUE)
lola: processed formula length: 8
lola: 32 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 12 markings, 11 edges
lola: ========================================
lola: subprocess 3 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((F ((2 <= p63)) OR (p13 <= p58))) U (2 <= p63))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (X ((F ((2 <= p63)) OR (p13 <= p58))) U (2 <= p63))
lola: processed formula length: 51
lola: 32 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: 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: subprocess 3 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (X (G ((1 <= p48)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (X (G ((1 <= p48)))))
lola: processed formula length: 26
lola: 32 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: 266 markings, 435 edges
lola: ========================================
lola: subprocess 4 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((X (X ((p27 + 1 <= p46))) OR G ((p28 + 1 <= p29))) U X ((p40 <= p4)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((X (X ((p27 + 1 <= p46))) OR G ((p28 + 1 <= p29))) U X ((p40 <= p4)))
lola: processed formula length: 70
lola: 32 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 8 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: 5 markings, 5 edges
lola: ========================================
lola: subprocess 5 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((p29 + 1 <= p64))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: (p64 <= p29)
lola: processed formula length: 12
lola: 34 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 11 markings, 11 edges
lola: ========================================
lola: subprocess 6 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((p23 + 1 <= p15)))
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 ((p23 + 1 <= p15)))
lola: processed formula length: 24
lola: 32 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: add low 137
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: 9 markings, 10 edges
lola: ========================================
lola: subprocess 7 will run for 1782 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((p18 + 1 <= p63))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p18 + 1 <= p63))
lola: processed formula length: 20
lola: 32 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: 21 markings, 22 edges
lola: ========================================
lola: subprocess 8 will run for 3565 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F ((p20 <= p39)) AND (2 <= p31))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F ((p20 <= p39)) AND (2 <= p31))))
lola: processed formula length: 41
lola: 32 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: 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: 11 markings, 12 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no no yes no no no no no
lola:
preliminary result: yes no no yes no no no no no
lola: memory consumption: 21008 KB
lola: time consumption: 5 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="PaceMaker-PT-none"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itslola"
echo " Input is PaceMaker-PT-none, 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 r174-csrt-158987853200457"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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