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-158987881900118.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-05track28LR, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-tajo-158987881900118
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 276K
-rw-r--r-- 1 mcc users 3.3K Mar 31 04:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 31 04:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 29 20:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 29 20:52 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:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 8 14:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.8K Mar 28 13:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 12K Mar 28 13:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 27 06:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 27 06:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 28 14:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K 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 12 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 108K 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-05track28LR-ReachabilityCardinality-00
FORMULA_NAME DNAwalker-PT-05track28LR-ReachabilityCardinality-01
FORMULA_NAME DNAwalker-PT-05track28LR-ReachabilityCardinality-02
FORMULA_NAME DNAwalker-PT-05track28LR-ReachabilityCardinality-03
FORMULA_NAME DNAwalker-PT-05track28LR-ReachabilityCardinality-04
FORMULA_NAME DNAwalker-PT-05track28LR-ReachabilityCardinality-05
FORMULA_NAME DNAwalker-PT-05track28LR-ReachabilityCardinality-06
FORMULA_NAME DNAwalker-PT-05track28LR-ReachabilityCardinality-07
FORMULA_NAME DNAwalker-PT-05track28LR-ReachabilityCardinality-08
FORMULA_NAME DNAwalker-PT-05track28LR-ReachabilityCardinality-09
FORMULA_NAME DNAwalker-PT-05track28LR-ReachabilityCardinality-10
FORMULA_NAME DNAwalker-PT-05track28LR-ReachabilityCardinality-11
FORMULA_NAME DNAwalker-PT-05track28LR-ReachabilityCardinality-12
FORMULA_NAME DNAwalker-PT-05track28LR-ReachabilityCardinality-13
FORMULA_NAME DNAwalker-PT-05track28LR-ReachabilityCardinality-14
FORMULA_NAME DNAwalker-PT-05track28LR-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1591203401891

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 16:56:43] [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 16:56:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 16:56:43] [INFO ] Load time of PNML (sax parser for PT used): 57 ms
[2020-06-03 16:56:43] [INFO ] Transformed 34 places.
[2020-06-03 16:56:43] [INFO ] Transformed 250 transitions.
[2020-06-03 16:56:43] [INFO ] Parsed PT model containing 34 places and 250 transitions in 93 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
FORMULA DNAwalker-PT-05track28LR-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 639 resets, run finished after 90 ms. (steps per millisecond=111 ) properties seen :[0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0]
FORMULA DNAwalker-PT-05track28LR-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DNAwalker-PT-05track28LR-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 65 resets, run finished after 24 ms. (steps per millisecond=416 ) properties seen :[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 17 ms. (steps per millisecond=588 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 80 resets, run finished after 12 ms. (steps per millisecond=833 ) properties seen :[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]
Incomplete Best-First random walk after 10001 steps, including 63 resets, run finished after 15 ms. (steps per millisecond=666 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 72 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]
Incomplete Best-First random walk after 10001 steps, including 61 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]
Incomplete Best-First random walk after 10001 steps, including 57 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]
Incomplete Best-First random walk after 10001 steps, including 62 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]
Incomplete Best-First random walk after 10001 steps, including 63 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]
Incomplete Best-First random walk after 10001 steps, including 60 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]
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]
Incomplete Best-First random walk after 10001 steps, including 57 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]
[2020-06-03 16:56:43] [INFO ] Flow matrix only has 247 transitions (discarded 3 similar events)
// Phase 1: matrix 247 rows 34 cols
[2020-06-03 16:56:43] [INFO ] Computed 0 place invariants in 5 ms
[2020-06-03 16:56:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:56:44] [INFO ] [Real]Absence check using state equation in 89 ms returned sat
[2020-06-03 16:56:44] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:56:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:56:44] [INFO ] [Nat]Absence check using state equation in 154 ms returned unsat
[2020-06-03 16:56:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:56:44] [INFO ] [Real]Absence check using state equation in 78 ms returned sat
[2020-06-03 16:56:44] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:56:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:56:44] [INFO ] [Nat]Absence check using state equation in 147 ms returned unsat
[2020-06-03 16:56:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:56:44] [INFO ] [Real]Absence check using state equation in 86 ms returned sat
[2020-06-03 16:56:44] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:56:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:56:44] [INFO ] [Nat]Absence check using state equation in 248 ms returned sat
[2020-06-03 16:56:44] [INFO ] State equation strengthened by 54 read => feed constraints.
[2020-06-03 16:56:44] [INFO ] [Nat]Added 54 Read/Feed constraints in 20 ms returned sat
[2020-06-03 16:56:45] [INFO ] Computed and/alt/rep : 234/2667/231 causal constraints in 32 ms.
[2020-06-03 16:56:45] [INFO ] Added : 28 causal constraints over 6 iterations in 250 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 19 ms.
[2020-06-03 16:56:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:56:45] [INFO ] [Real]Absence check using state equation in 62 ms returned unsat
[2020-06-03 16:56:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:56:45] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2020-06-03 16:56:45] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:56:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:56:45] [INFO ] [Nat]Absence check using state equation in 170 ms returned unsat
[2020-06-03 16:56:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:56:45] [INFO ] [Real]Absence check using state equation in 78 ms returned sat
[2020-06-03 16:56:45] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:56:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:56:45] [INFO ] [Nat]Absence check using state equation in 197 ms returned unsat
[2020-06-03 16:56:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:56:46] [INFO ] [Real]Absence check using state equation in 98 ms returned sat
[2020-06-03 16:56:46] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:56:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:56:46] [INFO ] [Nat]Absence check using state equation in 273 ms returned unsat
[2020-06-03 16:56:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:56:46] [INFO ] [Real]Absence check using state equation in 65 ms returned unsat
[2020-06-03 16:56:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:56:46] [INFO ] [Real]Absence check using state equation in 73 ms returned unsat
[2020-06-03 16:56:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:56:46] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2020-06-03 16:56:46] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:56:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:56:46] [INFO ] [Nat]Absence check using state equation in 95 ms returned unsat
[2020-06-03 16:56:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:56:46] [INFO ] [Real]Absence check using state equation in 72 ms returned unsat
[2020-06-03 16:56:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:56:46] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2020-06-03 16:56:46] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:56:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:56:47] [INFO ] [Nat]Absence check using state equation in 176 ms returned unsat
[2020-06-03 16:56:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:56:47] [INFO ] [Real]Absence check using state equation in 46 ms returned unsat
FORMULA DNAwalker-PT-05track28LR-ReachabilityCardinality-15 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DNAwalker-PT-05track28LR-ReachabilityCardinality-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DNAwalker-PT-05track28LR-ReachabilityCardinality-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DNAwalker-PT-05track28LR-ReachabilityCardinality-11 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DNAwalker-PT-05track28LR-ReachabilityCardinality-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DNAwalker-PT-05track28LR-ReachabilityCardinality-08 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DNAwalker-PT-05track28LR-ReachabilityCardinality-07 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DNAwalker-PT-05track28LR-ReachabilityCardinality-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DNAwalker-PT-05track28LR-ReachabilityCardinality-05 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DNAwalker-PT-05track28LR-ReachabilityCardinality-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DNAwalker-PT-05track28LR-ReachabilityCardinality-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DNAwalker-PT-05track28LR-ReachabilityCardinality-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 2900 steps, including 371 resets, run finished after 13 ms. (steps per millisecond=223 ) properties seen :[0] could not realise parikh vector
Support contains 3 out of 34 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 34/34 places, 250/250 transitions.
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Graph (complete) has 240 edges and 34 vertex of which 33 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.14 ms
Drop transitions removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 33 transition count 233
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 32 transition count 232
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 31 transition count 231
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 30 transition count 230
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 29 transition count 229
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 28 transition count 228
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 27 transition count 227
Applied a total of 23 rules in 95 ms. Remains 27 /34 variables (removed 7) and now considering 227/250 (removed 23) transitions.
// Phase 1: matrix 227 rows 27 cols
[2020-06-03 16:56:47] [INFO ] Computed 0 place invariants in 2 ms
[2020-06-03 16:56:47] [INFO ] Dead Transitions using invariants and state equation in 140 ms returned []
Finished structural reductions, in 1 iterations. Remains : 27/34 places, 227/250 transitions.
Incomplete random walk after 1000000 steps, including 88238 resets, run finished after 2503 ms. (steps per millisecond=399 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 15696 resets, run finished after 939 ms. (steps per millisecond=1064 ) properties seen :[0]
Interrupted probabilistic random walk after 20779265 steps, run timeout after 30001 ms. (steps per millisecond=692 ) properties seen :[0]
Probabilistic random walk after 20779265 steps, saw 5025966 distinct states, run finished after 30001 ms. (steps per millisecond=692 ) properties seen :[0]
// Phase 1: matrix 227 rows 27 cols
[2020-06-03 16:57:20] [INFO ] Computed 0 place invariants in 2 ms
[2020-06-03 16:57:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:57:20] [INFO ] [Real]Absence check using state equation in 142 ms returned sat
[2020-06-03 16:57:20] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:57:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:57:21] [INFO ] [Nat]Absence check using state equation in 171 ms returned sat
[2020-06-03 16:57:21] [INFO ] Computed and/alt/rep : 222/2029/222 causal constraints in 30 ms.
[2020-06-03 16:57:26] [INFO ] Added : 178 causal constraints over 48 iterations in 4856 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 30 ms.
Incomplete Parikh walk after 2400 steps, including 128 resets, run finished after 7 ms. (steps per millisecond=342 ) properties seen :[0] could not realise parikh vector
Support contains 3 out of 27 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 27/27 places, 227/227 transitions.
Applied a total of 0 rules in 3 ms. Remains 27 /27 variables (removed 0) and now considering 227/227 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 27/27 places, 227/227 transitions.
Starting structural reductions, iteration 0 : 27/27 places, 227/227 transitions.
Applied a total of 0 rules in 16 ms. Remains 27 /27 variables (removed 0) and now considering 227/227 (removed 0) transitions.
// Phase 1: matrix 227 rows 27 cols
[2020-06-03 16:57:26] [INFO ] Computed 0 place invariants in 1 ms
[2020-06-03 16:57:26] [INFO ] Implicit Places using invariants in 59 ms returned []
// Phase 1: matrix 227 rows 27 cols
[2020-06-03 16:57:26] [INFO ] Computed 0 place invariants in 15 ms
[2020-06-03 16:57:26] [INFO ] Implicit Places using invariants and state equation in 461 ms returned [23, 26]
Discarding 2 places :
Drop transitions removed 10 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 11 transitions.
Implicit Place search using SMT with State Equation took 537 ms to find 2 implicit places.
[2020-06-03 16:57:26] [INFO ] Redundant transitions in 30 ms returned []
// Phase 1: matrix 216 rows 25 cols
[2020-06-03 16:57:26] [INFO ] Computed 0 place invariants in 0 ms
[2020-06-03 16:57:26] [INFO ] Dead Transitions using invariants and state equation in 151 ms returned []
Starting structural reductions, iteration 1 : 25/27 places, 216/227 transitions.
Applied a total of 0 rules in 5 ms. Remains 25 /25 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2020-06-03 16:57:27] [INFO ] Redundant transitions in 145 ms returned []
// Phase 1: matrix 216 rows 25 cols
[2020-06-03 16:57:27] [INFO ] Computed 0 place invariants in 0 ms
[2020-06-03 16:57:27] [INFO ] Dead Transitions using invariants and state equation in 129 ms returned []
Finished structural reductions, in 2 iterations. Remains : 25/27 places, 216/227 transitions.
Incomplete random walk after 1000000 steps, including 67659 resets, run finished after 1989 ms. (steps per millisecond=502 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 13822 resets, run finished after 540 ms. (steps per millisecond=1851 ) properties seen :[0]
Interrupted probabilistic random walk after 22463323 steps, run timeout after 30001 ms. (steps per millisecond=748 ) properties seen :[0]
Probabilistic random walk after 22463323 steps, saw 5259830 distinct states, run finished after 30015 ms. (steps per millisecond=748 ) properties seen :[0]
// Phase 1: matrix 216 rows 25 cols
[2020-06-03 16:57:59] [INFO ] Computed 0 place invariants in 2 ms
[2020-06-03 16:57:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:57:59] [INFO ] [Real]Absence check using state equation in 86 ms returned sat
[2020-06-03 16:57:59] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:57:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:57:59] [INFO ] [Nat]Absence check using state equation in 141 ms returned sat
[2020-06-03 16:57:59] [INFO ] Computed and/alt/rep : 211/1942/211 causal constraints in 17 ms.
[2020-06-03 16:58:00] [INFO ] Added : 40 causal constraints over 9 iterations in 467 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 6 ms.
Incomplete Parikh walk after 2300 steps, including 122 resets, run finished after 5 ms. (steps per millisecond=460 ) properties seen :[0] could not realise parikh vector
Support contains 3 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 216/216 transitions.
Applied a total of 0 rules in 2 ms. Remains 25 /25 variables (removed 0) and now considering 216/216 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 25/25 places, 216/216 transitions.
Starting structural reductions, iteration 0 : 25/25 places, 216/216 transitions.
Applied a total of 0 rules in 2 ms. Remains 25 /25 variables (removed 0) and now considering 216/216 (removed 0) transitions.
// Phase 1: matrix 216 rows 25 cols
[2020-06-03 16:58:00] [INFO ] Computed 0 place invariants in 1 ms
[2020-06-03 16:58:00] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 216 rows 25 cols
[2020-06-03 16:58:00] [INFO ] Computed 0 place invariants in 0 ms
[2020-06-03 16:58:00] [INFO ] Implicit Places using invariants and state equation in 191 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
[2020-06-03 16:58:00] [INFO ] Redundant transitions in 24 ms returned []
// Phase 1: matrix 216 rows 25 cols
[2020-06-03 16:58:00] [INFO ] Computed 0 place invariants in 0 ms
[2020-06-03 16:58:00] [INFO ] Dead Transitions using invariants and state equation in 96 ms returned []
Finished structural reductions, in 1 iterations. Remains : 25/25 places, 216/216 transitions.
Incomplete random walk after 100000 steps, including 6793 resets, run finished after 191 ms. (steps per millisecond=523 ) properties seen :[0]
// Phase 1: matrix 216 rows 25 cols
[2020-06-03 16:58:01] [INFO ] Computed 0 place invariants in 1 ms
[2020-06-03 16:58:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:58:01] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2020-06-03 16:58:01] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:58:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:58:01] [INFO ] [Nat]Absence check using state equation in 160 ms returned sat
[2020-06-03 16:58:01] [INFO ] Computed and/alt/rep : 211/1942/211 causal constraints in 16 ms.
[2020-06-03 16:58:01] [INFO ] Added : 40 causal constraints over 9 iterations in 496 ms. Result :sat
Applied a total of 0 rules in 2 ms. Remains 25 /25 variables (removed 0) and now considering 216/216 (removed 0) transitions.
// Phase 1: matrix 216 rows 25 cols
[2020-06-03 16:58:01] [INFO ] Computed 0 place invariants in 1 ms
[2020-06-03 16:58:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:58:01] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2020-06-03 16:58:01] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:58:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:58:02] [INFO ] [Nat]Absence check using state equation in 129 ms returned sat
[2020-06-03 16:58:02] [INFO ] Computed and/alt/rep : 211/1942/211 causal constraints in 26 ms.
[2020-06-03 16:58:02] [INFO ] Added : 40 causal constraints over 9 iterations in 586 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 19 ms.
[2020-06-03 16:58:02] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 3 ms.
[2020-06-03 16:58:02] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 8 ms.
[2020-06-03 16:58:03] [INFO ] Flatten gal took : 87 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityCardinality @ DNAwalker-PT-05track28LR @ 3570 seconds

FORMULA DNAwalker-PT-05track28LR-ReachabilityCardinality-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS SYMMETRIES TOPOLOGICAL USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3547
rslt: Output for ReachabilityCardinality @ DNAwalker-PT-05track28LR

{
"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 16:58:03 2020
",
"timelimit": 3570
},
"child": null,
"exit":
{
"error": null,
"localtimelimitreached": true,
"memory": 17604,
"runtime": 23.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "A (G (((p0 <= 0) OR (p16 <= p19))))",
"processed_size": 36,
"rewrites": 2,
"skeleton": "A(G(**))"
},
"net":
{
"arcs": 646,
"conflict_clusters": 1,
"places": 25,
"places_significant": 25,
"singleton_clusters": 0,
"transitions": 216
},
"result":
{
"edges": 5,
"markings": 6,
"produced_by": "state space",
"value": true
},
"task":
{
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "invariance",
"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: 241/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 800
lola: finding significant places
lola: 25 places, 216 transitions, 25 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: A (G (((p0 <= 0) OR (p16 <= p19))))
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((p0 <= 0) OR (p16 <= p19))))
lola: processed formula length: 36
lola: 2 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: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: local time limit reached - aborting
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p0) AND (p19 + 1 <= p16))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityCardinality-0.sara
lola: state equation: calling and running sara
lola: RESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 6 markings, 5 edges
lola: memory consumption: 17604 KB
lola: time consumption: 23 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-05track28LR"
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-05track28LR, 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-158987881900118"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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