Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r178-tajo-158987881900142.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-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 itslola
Input is DNAwalker-PT-08ringLL, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-tajo-158987881900142
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 296K
-rw-r--r-- 1 mcc users 4.0K Mar 31 04:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 31 04:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 29 20:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 12K Mar 29 20:53 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.6K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Apr 8 14:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 8 14:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Mar 28 13:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 28 13:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.3K Mar 27 06:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 22K Mar 27 06:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 28 14:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 28 14:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 9 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 112K 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 DNAwalker-PT-08ringLL-ReachabilityCardinality-00
FORMULA_NAME DNAwalker-PT-08ringLL-ReachabilityCardinality-01
FORMULA_NAME DNAwalker-PT-08ringLL-ReachabilityCardinality-02
FORMULA_NAME DNAwalker-PT-08ringLL-ReachabilityCardinality-03
FORMULA_NAME DNAwalker-PT-08ringLL-ReachabilityCardinality-04
FORMULA_NAME DNAwalker-PT-08ringLL-ReachabilityCardinality-05
FORMULA_NAME DNAwalker-PT-08ringLL-ReachabilityCardinality-06
FORMULA_NAME DNAwalker-PT-08ringLL-ReachabilityCardinality-07
FORMULA_NAME DNAwalker-PT-08ringLL-ReachabilityCardinality-08
FORMULA_NAME DNAwalker-PT-08ringLL-ReachabilityCardinality-09
FORMULA_NAME DNAwalker-PT-08ringLL-ReachabilityCardinality-10
FORMULA_NAME DNAwalker-PT-08ringLL-ReachabilityCardinality-11
FORMULA_NAME DNAwalker-PT-08ringLL-ReachabilityCardinality-12
FORMULA_NAME DNAwalker-PT-08ringLL-ReachabilityCardinality-13
FORMULA_NAME DNAwalker-PT-08ringLL-ReachabilityCardinality-14
FORMULA_NAME DNAwalker-PT-08ringLL-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1591205827888

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 17:37:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 17:37:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 17:37:11] [INFO ] Load time of PNML (sax parser for PT used): 97 ms
[2020-06-03 17:37:11] [INFO ] Transformed 27 places.
[2020-06-03 17:37:11] [INFO ] Transformed 260 transitions.
[2020-06-03 17:37:11] [INFO ] Parsed PT model containing 27 places and 260 transitions in 176 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 806 resets, run finished after 134 ms. (steps per millisecond=74 ) properties seen :[0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA DNAwalker-PT-08ringLL-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 60 resets, run finished after 13 ms. (steps per millisecond=769 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 60 resets, run finished after 11 ms. (steps per millisecond=909 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 53 resets, run finished after 33 ms. (steps per millisecond=303 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 51 resets, run finished after 17 ms. (steps per millisecond=588 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 58 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 30 ms. (steps per millisecond=333 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 52 resets, run finished after 14 ms. (steps per millisecond=714 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 48 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 56 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 53 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 65 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 56 resets, run finished after 42 ms. (steps per millisecond=238 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 16 ms. (steps per millisecond=625 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 59 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
[2020-06-03 17:37:12] [INFO ] Flow matrix only has 259 transitions (discarded 1 similar events)
// Phase 1: matrix 259 rows 27 cols
[2020-06-03 17:37:12] [INFO ] Computed 0 place invariants in 10 ms
[2020-06-03 17:37:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 17:37:12] [INFO ] [Real]Absence check using state equation in 152 ms returned unsat
[2020-06-03 17:37:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 17:37:12] [INFO ] [Real]Absence check using state equation in 82 ms returned sat
[2020-06-03 17:37:12] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 17:37:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 17:37:13] [INFO ] [Nat]Absence check using state equation in 269 ms returned unsat
[2020-06-03 17:37:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 17:37:13] [INFO ] [Real]Absence check using state equation in 98 ms returned unsat
[2020-06-03 17:37:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 17:37:13] [INFO ] [Real]Absence check using state equation in 94 ms returned unsat
[2020-06-03 17:37:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 17:37:13] [INFO ] [Real]Absence check using state equation in 61 ms returned unsat
[2020-06-03 17:37:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 17:37:13] [INFO ] [Real]Absence check using state equation in 96 ms returned unsat
[2020-06-03 17:37:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 17:37:13] [INFO ] [Real]Absence check using state equation in 96 ms returned sat
[2020-06-03 17:37:13] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 17:37:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 17:37:13] [INFO ] [Nat]Absence check using state equation in 212 ms returned unsat
[2020-06-03 17:37:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 17:37:14] [INFO ] [Real]Absence check using state equation in 51 ms returned unsat
[2020-06-03 17:37:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 17:37:14] [INFO ] [Real]Absence check using state equation in 179 ms returned sat
[2020-06-03 17:37:14] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 17:37:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 17:37:14] [INFO ] [Nat]Absence check using state equation in 236 ms returned sat
[2020-06-03 17:37:14] [INFO ] State equation strengthened by 72 read => feed constraints.
[2020-06-03 17:37:14] [INFO ] [Nat]Added 72 Read/Feed constraints in 111 ms returned sat
[2020-06-03 17:37:14] [INFO ] Computed and/alt/rep : 234/3672/233 causal constraints in 25 ms.
[2020-06-03 17:37:14] [INFO ] Added : 22 causal constraints over 5 iterations in 333 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 21 ms.
[2020-06-03 17:37:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 17:37:15] [INFO ] [Real]Absence check using state equation in 142 ms returned sat
[2020-06-03 17:37:15] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 17:37:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 17:37:15] [INFO ] [Nat]Absence check using state equation in 196 ms returned unsat
[2020-06-03 17:37:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 17:37:15] [INFO ] [Real]Absence check using state equation in 284 ms returned sat
[2020-06-03 17:37:15] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 17:37:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 17:37:15] [INFO ] [Nat]Absence check using state equation in 218 ms returned unsat
[2020-06-03 17:37:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 17:37:16] [INFO ] [Real]Absence check using state equation in 38 ms returned unsat
[2020-06-03 17:37:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 17:37:16] [INFO ] [Real]Absence check using state equation in 123 ms returned sat
[2020-06-03 17:37:16] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 17:37:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 17:37:16] [INFO ] [Nat]Absence check using state equation in 203 ms returned unsat
[2020-06-03 17:37:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 17:37:16] [INFO ] [Real]Absence check using state equation in 78 ms returned sat
[2020-06-03 17:37:16] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 17:37:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 17:37:16] [INFO ] [Nat]Absence check using state equation in 281 ms returned unsat
[2020-06-03 17:37:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 17:37:16] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2020-06-03 17:37:16] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 17:37:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 17:37:17] [INFO ] [Nat]Absence check using state equation in 201 ms returned unsat
FORMULA DNAwalker-PT-08ringLL-ReachabilityCardinality-15 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DNAwalker-PT-08ringLL-ReachabilityCardinality-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DNAwalker-PT-08ringLL-ReachabilityCardinality-13 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DNAwalker-PT-08ringLL-ReachabilityCardinality-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DNAwalker-PT-08ringLL-ReachabilityCardinality-11 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DNAwalker-PT-08ringLL-ReachabilityCardinality-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DNAwalker-PT-08ringLL-ReachabilityCardinality-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DNAwalker-PT-08ringLL-ReachabilityCardinality-07 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DNAwalker-PT-08ringLL-ReachabilityCardinality-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DNAwalker-PT-08ringLL-ReachabilityCardinality-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DNAwalker-PT-08ringLL-ReachabilityCardinality-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DNAwalker-PT-08ringLL-ReachabilityCardinality-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DNAwalker-PT-08ringLL-ReachabilityCardinality-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DNAwalker-PT-08ringLL-ReachabilityCardinality-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 2300 steps, including 218 resets, run finished after 27 ms. (steps per millisecond=85 ) properties seen :[0] could not realise parikh vector
Support contains 10 out of 27 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 27/27 places, 260/260 transitions.
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 27 transition count 253
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 26 transition count 252
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 25 transition count 251
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 24 transition count 250
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 23 transition count 249
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 22 transition count 248
Applied a total of 12 rules in 125 ms. Remains 22 /27 variables (removed 5) and now considering 248/260 (removed 12) transitions.
// Phase 1: matrix 248 rows 22 cols
[2020-06-03 17:37:17] [INFO ] Computed 0 place invariants in 2 ms
[2020-06-03 17:37:17] [INFO ] Dead Transitions using invariants and state equation in 236 ms returned []
Finished structural reductions, in 1 iterations. Remains : 22/27 places, 248/260 transitions.
Incomplete random walk after 1000000 steps, including 117033 resets, run finished after 2751 ms. (steps per millisecond=363 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 8508 resets, run finished after 581 ms. (steps per millisecond=1721 ) properties seen :[0]
Interrupted probabilistic random walk after 22422983 steps, run timeout after 30001 ms. (steps per millisecond=747 ) properties seen :[0]
Probabilistic random walk after 22422983 steps, saw 3434820 distinct states, run finished after 30014 ms. (steps per millisecond=747 ) properties seen :[0]
// Phase 1: matrix 248 rows 22 cols
[2020-06-03 17:37:50] [INFO ] Computed 0 place invariants in 2 ms
[2020-06-03 17:37:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 17:37:50] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2020-06-03 17:37:50] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 17:37:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 17:37:51] [INFO ] [Nat]Absence check using state equation in 226 ms returned sat
[2020-06-03 17:37:51] [INFO ] State equation strengthened by 11 read => feed constraints.
[2020-06-03 17:37:51] [INFO ] [Nat]Added 11 Read/Feed constraints in 39 ms returned sat
[2020-06-03 17:37:51] [INFO ] Computed and/alt/rep : 227/2815/227 causal constraints in 43 ms.
[2020-06-03 17:37:51] [INFO ] Added : 23 causal constraints over 5 iterations in 304 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 30 ms.
Incomplete Parikh walk after 1700 steps, including 420 resets, run finished after 28 ms. (steps per millisecond=60 ) properties seen :[0] could not realise parikh vector
Support contains 10 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 248/248 transitions.
Applied a total of 0 rules in 7 ms. Remains 22 /22 variables (removed 0) and now considering 248/248 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 248/248 transitions.
Starting structural reductions, iteration 0 : 22/22 places, 248/248 transitions.
Applied a total of 0 rules in 6 ms. Remains 22 /22 variables (removed 0) and now considering 248/248 (removed 0) transitions.
// Phase 1: matrix 248 rows 22 cols
[2020-06-03 17:37:51] [INFO ] Computed 0 place invariants in 4 ms
[2020-06-03 17:37:51] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 248 rows 22 cols
[2020-06-03 17:37:51] [INFO ] Computed 0 place invariants in 2 ms
[2020-06-03 17:37:51] [INFO ] State equation strengthened by 11 read => feed constraints.
[2020-06-03 17:37:51] [INFO ] Implicit Places using invariants and state equation in 209 ms returned [17]
Discarding 1 places :
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Implicit Place search using SMT with State Equation took 243 ms to find 1 implicit places.
[2020-06-03 17:37:52] [INFO ] Redundant transitions in 822 ms returned []
// Phase 1: matrix 240 rows 21 cols
[2020-06-03 17:37:52] [INFO ] Computed 0 place invariants in 3 ms
[2020-06-03 17:37:58] [INFO ] Dead Transitions using invariants and state equation in 5380 ms returned []
Starting structural reductions, iteration 1 : 21/22 places, 240/248 transitions.
Applied a total of 0 rules in 20 ms. Remains 21 /21 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2020-06-03 17:37:58] [INFO ] Redundant transitions in 72 ms returned []
// Phase 1: matrix 240 rows 21 cols
[2020-06-03 17:37:58] [INFO ] Computed 0 place invariants in 1 ms
[2020-06-03 17:38:00] [INFO ] Dead Transitions using invariants and state equation in 2492 ms returned []
Finished structural reductions, in 2 iterations. Remains : 21/22 places, 240/248 transitions.
Incomplete random walk after 1000000 steps, including 98741 resets, run finished after 2399 ms. (steps per millisecond=416 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 7342 resets, run finished after 697 ms. (steps per millisecond=1434 ) properties seen :[0]
Probably explored full state space saw : 4041672 states, properties seen :[0]
Probabilistic random walk after 25780430 steps, saw 4041672 distinct states, run finished after 29815 ms. (steps per millisecond=864 ) properties seen :[0]
Interrupted probabilistic random walk after 23077998 steps, run timeout after 30001 ms. (steps per millisecond=769 ) properties seen :[0]
Exhaustive walk after 23077998 steps, saw 3660470 distinct states, run finished after 30001 ms. (steps per millisecond=769 ) properties seen :[0]
// Phase 1: matrix 240 rows 21 cols
[2020-06-03 17:39:03] [INFO ] Computed 0 place invariants in 1 ms
[2020-06-03 17:39:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 17:39:03] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2020-06-03 17:39:03] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 17:39:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 17:39:04] [INFO ] [Nat]Absence check using state equation in 294 ms returned sat
[2020-06-03 17:39:04] [INFO ] State equation strengthened by 11 read => feed constraints.
[2020-06-03 17:39:04] [INFO ] [Nat]Added 11 Read/Feed constraints in 41 ms returned sat
[2020-06-03 17:39:04] [INFO ] Computed and/alt/rep : 219/2714/219 causal constraints in 32 ms.
[2020-06-03 17:39:07] [INFO ] Added : 118 causal constraints over 40 iterations in 3819 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 21 ms.
Incomplete Parikh walk after 1800 steps, including 375 resets, run finished after 15 ms. (steps per millisecond=120 ) properties seen :[0] could not realise parikh vector
Support contains 10 out of 21 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 21/21 places, 240/240 transitions.
Applied a total of 0 rules in 170 ms. Remains 21 /21 variables (removed 0) and now considering 240/240 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 21/21 places, 240/240 transitions.
Starting structural reductions, iteration 0 : 21/21 places, 240/240 transitions.
Applied a total of 0 rules in 4 ms. Remains 21 /21 variables (removed 0) and now considering 240/240 (removed 0) transitions.
// Phase 1: matrix 240 rows 21 cols
[2020-06-03 17:39:08] [INFO ] Computed 0 place invariants in 1 ms
[2020-06-03 17:39:08] [INFO ] Implicit Places using invariants in 81 ms returned []
// Phase 1: matrix 240 rows 21 cols
[2020-06-03 17:39:08] [INFO ] Computed 0 place invariants in 1 ms
[2020-06-03 17:39:08] [INFO ] State equation strengthened by 11 read => feed constraints.
[2020-06-03 17:39:08] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 234 ms to find 0 implicit places.
[2020-06-03 17:39:08] [INFO ] Redundant transitions in 38 ms returned []
// Phase 1: matrix 240 rows 21 cols
[2020-06-03 17:39:08] [INFO ] Computed 0 place invariants in 1 ms
[2020-06-03 17:39:08] [INFO ] Dead Transitions using invariants and state equation in 288 ms returned []
Finished structural reductions, in 1 iterations. Remains : 21/21 places, 240/240 transitions.
Incomplete random walk after 100000 steps, including 9834 resets, run finished after 297 ms. (steps per millisecond=336 ) properties seen :[0]
// Phase 1: matrix 240 rows 21 cols
[2020-06-03 17:39:09] [INFO ] Computed 0 place invariants in 1 ms
[2020-06-03 17:39:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 17:39:09] [INFO ] [Real]Absence check using state equation in 87 ms returned sat
[2020-06-03 17:39:09] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 17:39:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 17:39:09] [INFO ] [Nat]Absence check using state equation in 140 ms returned sat
[2020-06-03 17:39:09] [INFO ] State equation strengthened by 11 read => feed constraints.
[2020-06-03 17:39:09] [INFO ] [Nat]Added 11 Read/Feed constraints in 20 ms returned sat
[2020-06-03 17:39:09] [INFO ] Computed and/alt/rep : 219/2714/219 causal constraints in 30 ms.
[2020-06-03 17:39:12] [INFO ] Added : 118 causal constraints over 40 iterations in 3603 ms. Result :sat
Applied a total of 0 rules in 3 ms. Remains 21 /21 variables (removed 0) and now considering 240/240 (removed 0) transitions.
// Phase 1: matrix 240 rows 21 cols
[2020-06-03 17:39:13] [INFO ] Computed 0 place invariants in 1 ms
[2020-06-03 17:39:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 17:39:13] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2020-06-03 17:39:13] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 17:39:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 17:39:13] [INFO ] [Nat]Absence check using state equation in 145 ms returned sat
[2020-06-03 17:39:13] [INFO ] Computed and/alt/rep : 218/2593/218 causal constraints in 26 ms.
[2020-06-03 17:39:14] [INFO ] Added : 60 causal constraints over 19 iterations in 1179 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 8 ms.
[2020-06-03 17:39:14] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 12 ms.
[2020-06-03 17:39:14] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 4 ms.
[2020-06-03 17:39:14] [INFO ] Flatten gal took : 113 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityCardinality @ DNAwalker-PT-08ringLL @ 3570 seconds

FORMULA DNAwalker-PT-08ringLL-ReachabilityCardinality-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS SYMMETRIES TOPOLOGICAL USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3506
rslt: Output for ReachabilityCardinality @ DNAwalker-PT-08ringLL

{
"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",
"localtimelimit": 0,
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=ReachabilityCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--json=ReachabilityCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed Jun 3 17:39:15 2020
",
"timelimit": 3570
},
"child": null,
"exit":
{
"error": null,
"localtimelimitreached": true,
"memory": 20840,
"runtime": 64.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "E (F (((p9 <= 0) AND (p7 + 1 <= p0) AND ((p20 <= p16) OR (p3 <= p8) OR ((p11 <= p4) AND (2 <= p19))))))",
"processed_size": 105,
"rewrites": 1,
"skeleton": "E(F(**))"
},
"net":
{
"arcs": 709,
"conflict_clusters": 2,
"places": 21,
"places_significant": 21,
"singleton_clusters": 0,
"transitions": 240
},
"result":
{
"edges": 60,
"markings": 61,
"produced_by": "state space",
"value": false
},
"task":
{
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 10,
"problems": 3
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
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: 261/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 672
lola: finding significant places
lola: 21 places, 240 transitions, 21 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 ReachabilityCardinality.xml
lola: E (F (((p9 <= 0) AND (p7 + 1 <= p0) AND ((p20 <= p16) OR (p3 <= p8) OR ((p11 <= p4) AND (2 <= p19))))))
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((p9 <= 0) AND (p7 + 1 <= p0) AND ((p20 <= p16) OR (p3 <= p8) OR ((p11 <= p4) AND (2 <= p19))))))
lola: processed formula length: 105
lola: 1 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: subprocess will run for 0 seconds at most (--localtimelimit)
lola: local time limit reached - aborting
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p9 <= 0) AND (p7 + 1 <= p0) AND ((p20 <= p16) OR (p3 <= p8) OR ((p11 <= p4) AND (2 <= p19))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 10 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityCardinality-0.sara
lola: state equation: calling and running sara
lola: RESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 61 markings, 60 edges
lola: memory consumption: 20840 KB
lola: time consumption: 64 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityCardinality.json
lola: closed JSON file ReachabilityCardinality.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="DNAwalker-PT-08ringLL"
export BK_EXAMINATION="ReachabilityCardinality"
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 DNAwalker-PT-08ringLL, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r178-tajo-158987881900142"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DNAwalker-PT-08ringLL.tgz
mv DNAwalker-PT-08ringLL execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;