Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 376K
-rw-r--r-- 1 mcc users 5.6K Apr 27 15:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 27 15:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K Apr 27 15:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 27 15:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 27 15:14 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.6K Apr 27 15:14 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 6.1K Apr 27 15:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.5K Apr 27 15:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.4K Apr 27 15:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 27 15:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.4K Apr 27 15:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 27 15:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Apr 27 15:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Apr 27 15:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Apr 27 15:14 equiv_col
-rw-r--r-- 1 mcc users 5 Apr 27 15:14 instance
-rw-r--r-- 1 mcc users 6 Apr 27 15:14 iscolored
-rw-r--r-- 1 mcc users 171K Apr 27 15:14 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 IBM5964-PT-none-00
FORMULA_NAME IBM5964-PT-none-01
FORMULA_NAME IBM5964-PT-none-02
FORMULA_NAME IBM5964-PT-none-03
FORMULA_NAME IBM5964-PT-none-04
FORMULA_NAME IBM5964-PT-none-05
FORMULA_NAME IBM5964-PT-none-06
FORMULA_NAME IBM5964-PT-none-07
FORMULA_NAME IBM5964-PT-none-08
FORMULA_NAME IBM5964-PT-none-09
FORMULA_NAME IBM5964-PT-none-10
FORMULA_NAME IBM5964-PT-none-11
FORMULA_NAME IBM5964-PT-none-12
FORMULA_NAME IBM5964-PT-none-13
FORMULA_NAME IBM5964-PT-none-14
FORMULA_NAME IBM5964-PT-none-15

=== Now, execution of the tool begins

BK_START 1591204591242

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 17:16:33] [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 17:16:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 17:16:33] [INFO ] Load time of PNML (sax parser for PT used): 50 ms
[2020-06-03 17:16:33] [INFO ] Transformed 263 places.
[2020-06-03 17:16:33] [INFO ] Transformed 139 transitions.
[2020-06-03 17:16:33] [INFO ] Parsed PT model containing 263 places and 139 transitions in 91 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 100001 steps, including 2139 resets, run finished after 274 ms. (steps per millisecond=364 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 139 rows 263 cols
[2020-06-03 17:16:33] [INFO ] Computed 128 place invariants in 9 ms
[2020-06-03 17:16:33] [INFO ] [Real]Absence check using 3 positive place invariants in 21 ms returned sat
[2020-06-03 17:16:33] [INFO ] [Real]Absence check using 3 positive and 125 generalized place invariants in 39 ms returned sat
[2020-06-03 17:16:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 17:16:33] [INFO ] [Real]Absence check using state equation in 165 ms returned sat
[2020-06-03 17:16:33] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 17:16:34] [INFO ] [Nat]Absence check using 3 positive place invariants in 12 ms returned sat
[2020-06-03 17:16:34] [INFO ] [Nat]Absence check using 3 positive and 125 generalized place invariants in 24 ms returned unsat
[2020-06-03 17:16:34] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned unsat
[2020-06-03 17:16:34] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned unsat
[2020-06-03 17:16:34] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned unsat
[2020-06-03 17:16:34] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2020-06-03 17:16:34] [INFO ] [Real]Absence check using 3 positive and 125 generalized place invariants in 31 ms returned sat
[2020-06-03 17:16:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 17:16:34] [INFO ] [Real]Absence check using state equation in 25 ms returned unsat
[2020-06-03 17:16:34] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2020-06-03 17:16:34] [INFO ] [Real]Absence check using 3 positive and 125 generalized place invariants in 31 ms returned sat
[2020-06-03 17:16:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 17:16:34] [INFO ] [Real]Absence check using state equation in 141 ms returned sat
[2020-06-03 17:16:34] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 17:16:34] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2020-06-03 17:16:34] [INFO ] [Nat]Absence check using 3 positive and 125 generalized place invariants in 15 ms returned unsat
[2020-06-03 17:16:34] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2020-06-03 17:16:34] [INFO ] [Real]Absence check using 3 positive and 125 generalized place invariants in 40 ms returned sat
[2020-06-03 17:16:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 17:16:34] [INFO ] [Real]Absence check using state equation in 163 ms returned sat
[2020-06-03 17:16:34] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 17:16:34] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2020-06-03 17:16:34] [INFO ] [Nat]Absence check using 3 positive and 125 generalized place invariants in 21 ms returned unsat
[2020-06-03 17:16:34] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2020-06-03 17:16:34] [INFO ] [Real]Absence check using 3 positive and 125 generalized place invariants in 30 ms returned sat
[2020-06-03 17:16:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 17:16:34] [INFO ] [Real]Absence check using state equation in 142 ms returned sat
[2020-06-03 17:16:34] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 17:16:35] [INFO ] [Nat]Absence check using 3 positive place invariants in 11 ms returned sat
[2020-06-03 17:16:35] [INFO ] [Nat]Absence check using 3 positive and 125 generalized place invariants in 14 ms returned unsat
[2020-06-03 17:16:35] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2020-06-03 17:16:35] [INFO ] [Real]Absence check using 3 positive and 125 generalized place invariants in 23 ms returned unsat
[2020-06-03 17:16:35] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2020-06-03 17:16:35] [INFO ] [Real]Absence check using 3 positive and 125 generalized place invariants in 29 ms returned sat
[2020-06-03 17:16:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 17:16:35] [INFO ] [Real]Absence check using state equation in 158 ms returned sat
[2020-06-03 17:16:35] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 17:16:35] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2020-06-03 17:16:35] [INFO ] [Nat]Absence check using 3 positive and 125 generalized place invariants in 4 ms returned unsat
[2020-06-03 17:16:35] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2020-06-03 17:16:35] [INFO ] [Real]Absence check using 3 positive and 125 generalized place invariants in 49 ms returned sat
[2020-06-03 17:16:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 17:16:35] [INFO ] [Real]Absence check using state equation in 150 ms returned sat
[2020-06-03 17:16:35] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 17:16:35] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2020-06-03 17:16:35] [INFO ] [Nat]Absence check using 3 positive and 125 generalized place invariants in 22 ms returned unsat
[2020-06-03 17:16:35] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2020-06-03 17:16:35] [INFO ] [Real]Absence check using 3 positive and 125 generalized place invariants in 31 ms returned sat
[2020-06-03 17:16:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 17:16:35] [INFO ] [Real]Absence check using state equation in 160 ms returned sat
[2020-06-03 17:16:35] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 17:16:35] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2020-06-03 17:16:35] [INFO ] [Nat]Absence check using 3 positive and 125 generalized place invariants in 6 ms returned unsat
[2020-06-03 17:16:35] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2020-06-03 17:16:35] [INFO ] [Real]Absence check using 3 positive and 125 generalized place invariants in 31 ms returned sat
[2020-06-03 17:16:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 17:16:36] [INFO ] [Real]Absence check using state equation in 180 ms returned sat
[2020-06-03 17:16:36] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 17:16:36] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2020-06-03 17:16:36] [INFO ] [Nat]Absence check using 3 positive and 125 generalized place invariants in 4 ms returned unsat
[2020-06-03 17:16:36] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2020-06-03 17:16:36] [INFO ] [Real]Absence check using 3 positive and 125 generalized place invariants in 16 ms returned unsat
[2020-06-03 17:16:36] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2020-06-03 17:16:36] [INFO ] [Real]Absence check using 3 positive and 125 generalized place invariants in 30 ms returned sat
[2020-06-03 17:16:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 17:16:36] [INFO ] [Real]Absence check using state equation in 149 ms returned sat
[2020-06-03 17:16:36] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 17:16:36] [INFO ] [Nat]Absence check using 3 positive place invariants in 11 ms returned sat
[2020-06-03 17:16:36] [INFO ] [Nat]Absence check using 3 positive and 125 generalized place invariants in 4 ms returned unsat
[2020-06-03 17:16:36] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2020-06-03 17:16:36] [INFO ] [Real]Absence check using 3 positive and 125 generalized place invariants in 4 ms returned unsat
[2020-06-03 17:16:36] [INFO ] [Real]Absence check using 3 positive place invariants in 19 ms returned sat
[2020-06-03 17:16:36] [INFO ] [Real]Absence check using 3 positive and 125 generalized place invariants in 14 ms returned unsat
[2020-06-03 17:16:36] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2020-06-03 17:16:36] [INFO ] [Real]Absence check using 3 positive and 125 generalized place invariants in 10 ms returned unsat
[2020-06-03 17:16:36] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2020-06-03 17:16:36] [INFO ] [Real]Absence check using 3 positive and 125 generalized place invariants in 29 ms returned sat
[2020-06-03 17:16:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 17:16:36] [INFO ] [Real]Absence check using state equation in 163 ms returned sat
[2020-06-03 17:16:36] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 17:16:36] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2020-06-03 17:16:36] [INFO ] [Nat]Absence check using 3 positive and 125 generalized place invariants in 9 ms returned unsat
[2020-06-03 17:16:36] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2020-06-03 17:16:36] [INFO ] [Real]Absence check using 3 positive and 125 generalized place invariants in 30 ms returned sat
[2020-06-03 17:16:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 17:16:37] [INFO ] [Real]Absence check using state equation in 56 ms returned unsat
[2020-06-03 17:16:37] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2020-06-03 17:16:37] [INFO ] [Real]Absence check using 3 positive and 125 generalized place invariants in 32 ms returned sat
[2020-06-03 17:16:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 17:16:37] [INFO ] [Real]Absence check using state equation in 164 ms returned sat
[2020-06-03 17:16:37] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 17:16:37] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2020-06-03 17:16:37] [INFO ] [Nat]Absence check using 3 positive and 125 generalized place invariants in 5 ms returned unsat
[2020-06-03 17:16:37] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2020-06-03 17:16:37] [INFO ] [Real]Absence check using 3 positive and 125 generalized place invariants in 31 ms returned sat
[2020-06-03 17:16:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 17:16:37] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2020-06-03 17:16:37] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 17:16:37] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2020-06-03 17:16:37] [INFO ] [Nat]Absence check using 3 positive and 125 generalized place invariants in 6 ms returned unsat
[2020-06-03 17:16:37] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2020-06-03 17:16:37] [INFO ] [Real]Absence check using 3 positive and 125 generalized place invariants in 6 ms returned unsat
[2020-06-03 17:16:37] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2020-06-03 17:16:37] [INFO ] [Real]Absence check using 3 positive and 125 generalized place invariants in 24 ms returned unsat
[2020-06-03 17:16:37] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned unsat
[2020-06-03 17:16:37] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned unsat
[2020-06-03 17:16:37] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2020-06-03 17:16:37] [INFO ] [Real]Absence check using 3 positive and 125 generalized place invariants in 33 ms returned sat
[2020-06-03 17:16:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 17:16:37] [INFO ] [Real]Absence check using state equation in 155 ms returned sat
[2020-06-03 17:16:37] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 17:16:38] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2020-06-03 17:16:38] [INFO ] [Nat]Absence check using 3 positive and 125 generalized place invariants in 8 ms returned unsat
[2020-06-03 17:16:38] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2020-06-03 17:16:38] [INFO ] [Real]Absence check using 3 positive and 125 generalized place invariants in 33 ms returned sat
[2020-06-03 17:16:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 17:16:38] [INFO ] [Real]Absence check using state equation in 152 ms returned sat
[2020-06-03 17:16:38] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 17:16:38] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2020-06-03 17:16:38] [INFO ] [Nat]Absence check using 3 positive and 125 generalized place invariants in 17 ms returned unsat
[2020-06-03 17:16:38] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned unsat
[2020-06-03 17:16:38] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2020-06-03 17:16:38] [INFO ] [Real]Absence check using 3 positive and 125 generalized place invariants in 33 ms returned sat
[2020-06-03 17:16:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 17:16:38] [INFO ] [Real]Absence check using state equation in 158 ms returned sat
[2020-06-03 17:16:38] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 17:16:38] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2020-06-03 17:16:38] [INFO ] [Nat]Absence check using 3 positive and 125 generalized place invariants in 4 ms returned unsat
[2020-06-03 17:16:38] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2020-06-03 17:16:38] [INFO ] [Real]Absence check using 3 positive and 125 generalized place invariants in 34 ms returned sat
[2020-06-03 17:16:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 17:16:38] [INFO ] [Real]Absence check using state equation in 158 ms returned sat
[2020-06-03 17:16:38] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 17:16:38] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2020-06-03 17:16:38] [INFO ] [Nat]Absence check using 3 positive and 125 generalized place invariants in 4 ms returned unsat
[2020-06-03 17:16:38] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2020-06-03 17:16:38] [INFO ] [Real]Absence check using 3 positive and 125 generalized place invariants in 5 ms returned unsat
[2020-06-03 17:16:38] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned unsat
[2020-06-03 17:16:38] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2020-06-03 17:16:38] [INFO ] [Real]Absence check using 3 positive and 125 generalized place invariants in 32 ms returned sat
[2020-06-03 17:16:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 17:16:39] [INFO ] [Real]Absence check using state equation in 155 ms returned sat
[2020-06-03 17:16:39] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 17:16:39] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2020-06-03 17:16:39] [INFO ] [Nat]Absence check using 3 positive and 125 generalized place invariants in 22 ms returned unsat
[2020-06-03 17:16:39] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2020-06-03 17:16:39] [INFO ] [Real]Absence check using 3 positive and 125 generalized place invariants in 33 ms returned sat
[2020-06-03 17:16:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 17:16:39] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2020-06-03 17:16:39] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 17:16:39] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2020-06-03 17:16:39] [INFO ] [Nat]Absence check using 3 positive and 125 generalized place invariants in 4 ms returned unsat
[2020-06-03 17:16:39] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2020-06-03 17:16:39] [INFO ] [Real]Absence check using 3 positive and 125 generalized place invariants in 33 ms returned sat
[2020-06-03 17:16:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 17:16:39] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2020-06-03 17:16:39] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 17:16:39] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2020-06-03 17:16:39] [INFO ] [Nat]Absence check using 3 positive and 125 generalized place invariants in 32 ms returned sat
[2020-06-03 17:16:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 17:16:39] [INFO ] [Nat]Absence check using state equation in 89 ms returned unsat
[2020-06-03 17:16:39] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2020-06-03 17:16:39] [INFO ] [Real]Absence check using 3 positive and 125 generalized place invariants in 30 ms returned sat
[2020-06-03 17:16:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 17:16:40] [INFO ] [Real]Absence check using state equation in 147 ms returned sat
[2020-06-03 17:16:40] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 17:16:40] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2020-06-03 17:16:40] [INFO ] [Nat]Absence check using 3 positive and 125 generalized place invariants in 4 ms returned unsat
[2020-06-03 17:16:40] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2020-06-03 17:16:40] [INFO ] [Real]Absence check using 3 positive and 125 generalized place invariants in 4 ms returned unsat
[2020-06-03 17:16:40] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2020-06-03 17:16:40] [INFO ] [Real]Absence check using 3 positive and 125 generalized place invariants in 19 ms returned unsat
Successfully simplified 39 atomic propositions for a total of 44 simplifications.
[2020-06-03 17:16:40] [INFO ] Initial state reduction rules for CTL removed 14 formulas.
[2020-06-03 17:16:40] [INFO ] Flatten gal took : 42 ms
FORMULA IBM5964-PT-none-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 17:16:40] [INFO ] Flatten gal took : 13 ms
[2020-06-03 17:16:40] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2020-06-03 17:16:40] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 3 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ IBM5964-PT-none @ 3570 seconds

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

FORMULA IBM5964-PT-none-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3567
rslt: Output for LTLCardinality @ IBM5964-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 17:16:40 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1783
},
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "G (F ((2 <= p212)))",
"processed_size": 19,
"rewrites": 7
},
"result":
{
"edges": 35,
"markings": 35,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3567
},
"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 ((p102 <= p52)))",
"processed_size": 21,
"rewrites": 7
},
"result":
{
"edges": 37,
"markings": 36,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 17576,
"runtime": 3.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "F(G(**)) : G(F(**))"
},
"net":
{
"arcs": 541,
"conflict_clusters": 135,
"places": 263,
"places_significant": 135,
"singleton_clusters": 0,
"transitions": 139
},
"result":
{
"preliminary_value": "no no ",
"value": "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: 402/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 8416
lola: finding significant places
lola: 263 places, 139 transitions, 135 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 ((p102 <= p52))) : G ((X ((X (G ((2 <= p212))) OR ((2 <= p212) U (0 <= 0)))) AND X (F ((2 <= p212)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:166
lola: rewrite Frontend/Parser/formula_rewrite.k:123
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((2 <= p212)))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((2 <= p212)))
lola: processed formula length: 19
lola: 7 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: 35 markings, 35 edges
lola: ========================================
lola: subprocess 1 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((p102 <= p52)))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((p102 <= p52)))
lola: processed formula length: 21
lola: 7 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: 36 markings, 37 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no
lola:
preliminary result: no no
lola: memory consumption: 17576 KB
lola: time consumption: 3 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="IBM5964-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 IBM5964-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 r184-oct2-158987928400329"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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