About the Execution of ITS-Tools for Peterson-PT-3
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15744.120 | 22171.00 | 38941.00 | 44.70 | TFTTTTFTFFFTTTFT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/local/x2003239/mcc2020-input.r111-csrt-158961258100718.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2020-input.qcow2 encryption=off cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is Peterson-PT-3, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r111-csrt-158961258100718
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 716K
-rw-r--r-- 1 mcc users 14K Apr 27 15:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 46K Apr 27 15:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 17K Apr 27 15:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K 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 6.0K Apr 27 15:14 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 23K Apr 27 15:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Apr 27 15:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 40K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 27 15:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 37K Apr 27 15:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Apr 27 15:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 27 15:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 5.8K Apr 27 15:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 12K Apr 27 15:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Apr 27 15:14 equiv_col
-rw-r--r-- 1 mcc users 2 Apr 27 15:14 instance
-rw-r--r-- 1 mcc users 6 Apr 27 15:14 iscolored
-rw-r--r-- 1 mcc users 248K 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 Peterson-PT-3-ReachabilityCardinality-00
FORMULA_NAME Peterson-PT-3-ReachabilityCardinality-01
FORMULA_NAME Peterson-PT-3-ReachabilityCardinality-02
FORMULA_NAME Peterson-PT-3-ReachabilityCardinality-03
FORMULA_NAME Peterson-PT-3-ReachabilityCardinality-04
FORMULA_NAME Peterson-PT-3-ReachabilityCardinality-05
FORMULA_NAME Peterson-PT-3-ReachabilityCardinality-06
FORMULA_NAME Peterson-PT-3-ReachabilityCardinality-07
FORMULA_NAME Peterson-PT-3-ReachabilityCardinality-08
FORMULA_NAME Peterson-PT-3-ReachabilityCardinality-09
FORMULA_NAME Peterson-PT-3-ReachabilityCardinality-10
FORMULA_NAME Peterson-PT-3-ReachabilityCardinality-11
FORMULA_NAME Peterson-PT-3-ReachabilityCardinality-12
FORMULA_NAME Peterson-PT-3-ReachabilityCardinality-13
FORMULA_NAME Peterson-PT-3-ReachabilityCardinality-14
FORMULA_NAME Peterson-PT-3-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1590023219642
[2020-05-21 01:07:01] [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, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-21 01:07:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-21 01:07:01] [INFO ] Load time of PNML (sax parser for PT used): 168 ms
[2020-05-21 01:07:01] [INFO ] Transformed 244 places.
[2020-05-21 01:07:01] [INFO ] Transformed 332 transitions.
[2020-05-21 01:07:01] [INFO ] Parsed PT model containing 244 places and 332 transitions in 220 ms.
[2020-05-21 01:07:01] [INFO ] Initial state test concluded for 1 properties.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 27 ms.
Working with output stream class java.io.PrintStream
FORMULA Peterson-PT-3-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 0 resets, run finished after 84 ms. (steps per millisecond=119 ) properties seen :[1, 0, 1, 1, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0]
FORMULA Peterson-PT-3-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-3-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-3-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-3-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-3-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 19 ms. (steps per millisecond=526 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 16 ms. (steps per millisecond=625 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 23 ms. (steps per millisecond=434 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 11 ms. (steps per millisecond=909 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 12 ms. (steps per millisecond=833 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 16 ms. (steps per millisecond=625 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 12 ms. (steps per millisecond=833 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 20 ms. (steps per millisecond=500 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 25 ms. (steps per millisecond=400 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
[2020-05-21 01:07:02] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 244 cols
[2020-05-21 01:07:02] [INFO ] Computed 15 place invariants in 16 ms
[2020-05-21 01:07:02] [INFO ] [Real]Absence check using 11 positive place invariants in 25 ms returned unsat
[2020-05-21 01:07:02] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned unsat
[2020-05-21 01:07:02] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned unsat
[2020-05-21 01:07:02] [INFO ] [Real]Absence check using 11 positive place invariants in 11 ms returned sat
[2020-05-21 01:07:02] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2020-05-21 01:07:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:07:02] [INFO ] [Real]Absence check using state equation in 220 ms returned sat
[2020-05-21 01:07:02] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:07:02] [INFO ] [Nat]Absence check using 11 positive place invariants in 19 ms returned sat
[2020-05-21 01:07:02] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 3 ms returned sat
[2020-05-21 01:07:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:07:03] [INFO ] [Nat]Absence check using state equation in 204 ms returned sat
[2020-05-21 01:07:03] [INFO ] State equation strengthened by 66 read => feed constraints.
[2020-05-21 01:07:03] [INFO ] [Nat]Added 66 Read/Feed constraints in 18 ms returned sat
[2020-05-21 01:07:03] [INFO ] Deduced a trap composed of 16 places in 140 ms
[2020-05-21 01:07:03] [INFO ] Deduced a trap composed of 16 places in 75 ms
[2020-05-21 01:07:03] [INFO ] Deduced a trap composed of 41 places in 52 ms
[2020-05-21 01:07:03] [INFO ] Deduced a trap composed of 31 places in 54 ms
[2020-05-21 01:07:03] [INFO ] Deduced a trap composed of 38 places in 43 ms
[2020-05-21 01:07:03] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 482 ms
[2020-05-21 01:07:03] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 23 ms.
[2020-05-21 01:07:05] [INFO ] Added : 304 causal constraints over 61 iterations in 1420 ms. Result :sat
[2020-05-21 01:07:05] [INFO ] Deduced a trap composed of 17 places in 125 ms
[2020-05-21 01:07:05] [INFO ] Deduced a trap composed of 12 places in 134 ms
[2020-05-21 01:07:05] [INFO ] Deduced a trap composed of 9 places in 98 ms
[2020-05-21 01:07:05] [INFO ] Deduced a trap composed of 30 places in 103 ms
[2020-05-21 01:07:05] [INFO ] Deduced a trap composed of 60 places in 76 ms
[2020-05-21 01:07:05] [INFO ] Deduced a trap composed of 65 places in 74 ms
[2020-05-21 01:07:05] [INFO ] Deduced a trap composed of 73 places in 63 ms
[2020-05-21 01:07:06] [INFO ] Deduced a trap composed of 27 places in 138 ms
[2020-05-21 01:07:06] [INFO ] Deduced a trap composed of 30 places in 130 ms
[2020-05-21 01:07:06] [INFO ] Deduced a trap composed of 45 places in 106 ms
[2020-05-21 01:07:06] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1341 ms
Attempting to minimize the solution found.
Minimization took 25 ms.
[2020-05-21 01:07:06] [INFO ] [Real]Absence check using 11 positive place invariants in 12 ms returned sat
[2020-05-21 01:07:06] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2020-05-21 01:07:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:07:06] [INFO ] [Real]Absence check using state equation in 201 ms returned sat
[2020-05-21 01:07:06] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:07:06] [INFO ] [Nat]Absence check using 11 positive place invariants in 15 ms returned sat
[2020-05-21 01:07:06] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2020-05-21 01:07:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:07:07] [INFO ] [Nat]Absence check using state equation in 210 ms returned sat
[2020-05-21 01:07:07] [INFO ] [Nat]Added 66 Read/Feed constraints in 13 ms returned sat
[2020-05-21 01:07:07] [INFO ] Deduced a trap composed of 9 places in 104 ms
[2020-05-21 01:07:07] [INFO ] Deduced a trap composed of 31 places in 86 ms
[2020-05-21 01:07:07] [INFO ] Deduced a trap composed of 20 places in 85 ms
[2020-05-21 01:07:07] [INFO ] Deduced a trap composed of 31 places in 87 ms
[2020-05-21 01:07:07] [INFO ] Deduced a trap composed of 52 places in 82 ms
[2020-05-21 01:07:07] [INFO ] Deduced a trap composed of 38 places in 74 ms
[2020-05-21 01:07:07] [INFO ] Deduced a trap composed of 59 places in 74 ms
[2020-05-21 01:07:07] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 690 ms
[2020-05-21 01:07:07] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 15 ms.
[2020-05-21 01:07:09] [INFO ] Added : 304 causal constraints over 61 iterations in 1404 ms. Result :sat
[2020-05-21 01:07:09] [INFO ] Deduced a trap composed of 56 places in 79 ms
[2020-05-21 01:07:09] [INFO ] Deduced a trap composed of 56 places in 61 ms
[2020-05-21 01:07:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 226 ms
Attempting to minimize the solution found.
Minimization took 14 ms.
[2020-05-21 01:07:09] [INFO ] [Real]Absence check using 11 positive place invariants in 25 ms returned sat
[2020-05-21 01:07:09] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 4 ms returned sat
[2020-05-21 01:07:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:07:09] [INFO ] [Real]Absence check using state equation in 200 ms returned sat
[2020-05-21 01:07:09] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:07:09] [INFO ] [Nat]Absence check using 11 positive place invariants in 20 ms returned sat
[2020-05-21 01:07:09] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2020-05-21 01:07:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:07:10] [INFO ] [Nat]Absence check using state equation in 258 ms returned sat
[2020-05-21 01:07:10] [INFO ] [Nat]Added 66 Read/Feed constraints in 19 ms returned sat
[2020-05-21 01:07:10] [INFO ] Deduced a trap composed of 13 places in 62 ms
[2020-05-21 01:07:10] [INFO ] Deduced a trap composed of 16 places in 69 ms
[2020-05-21 01:07:10] [INFO ] Deduced a trap composed of 13 places in 66 ms
[2020-05-21 01:07:10] [INFO ] Deduced a trap composed of 31 places in 46 ms
[2020-05-21 01:07:10] [INFO ] Deduced a trap composed of 31 places in 74 ms
[2020-05-21 01:07:10] [INFO ] Deduced a trap composed of 38 places in 123 ms
[2020-05-21 01:07:10] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 534 ms
[2020-05-21 01:07:10] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 16 ms.
[2020-05-21 01:07:11] [INFO ] Added : 304 causal constraints over 61 iterations in 1363 ms. Result :sat
[2020-05-21 01:07:12] [INFO ] Deduced a trap composed of 48 places in 84 ms
[2020-05-21 01:07:12] [INFO ] Deduced a trap composed of 49 places in 86 ms
[2020-05-21 01:07:12] [INFO ] Deduced a trap composed of 16 places in 75 ms
[2020-05-21 01:07:12] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 410 ms
Attempting to minimize the solution found.
Minimization took 15 ms.
[2020-05-21 01:07:12] [INFO ] [Real]Absence check using 11 positive place invariants in 15 ms returned sat
[2020-05-21 01:07:12] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2020-05-21 01:07:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:07:12] [INFO ] [Real]Absence check using state equation in 230 ms returned sat
[2020-05-21 01:07:12] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:07:12] [INFO ] [Nat]Absence check using 11 positive place invariants in 14 ms returned sat
[2020-05-21 01:07:12] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 12 ms returned sat
[2020-05-21 01:07:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:07:12] [INFO ] [Nat]Absence check using state equation in 210 ms returned sat
[2020-05-21 01:07:12] [INFO ] [Nat]Added 66 Read/Feed constraints in 12 ms returned sat
[2020-05-21 01:07:13] [INFO ] Deduced a trap composed of 9 places in 71 ms
[2020-05-21 01:07:13] [INFO ] Deduced a trap composed of 9 places in 77 ms
[2020-05-21 01:07:13] [INFO ] Deduced a trap composed of 9 places in 130 ms
[2020-05-21 01:07:13] [INFO ] Deduced a trap composed of 45 places in 87 ms
[2020-05-21 01:07:13] [INFO ] Deduced a trap composed of 45 places in 71 ms
[2020-05-21 01:07:13] [INFO ] Deduced a trap composed of 45 places in 74 ms
[2020-05-21 01:07:13] [INFO ] Deduced a trap composed of 27 places in 37 ms
[2020-05-21 01:07:13] [INFO ] Deduced a trap composed of 27 places in 47 ms
[2020-05-21 01:07:13] [INFO ] Deduced a trap composed of 27 places in 32 ms
[2020-05-21 01:07:13] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 767 ms
[2020-05-21 01:07:13] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 19 ms.
[2020-05-21 01:07:14] [INFO ] Added : 245 causal constraints over 49 iterations in 902 ms. Result :sat
[2020-05-21 01:07:14] [INFO ] Deduced a trap composed of 39 places in 59 ms
[2020-05-21 01:07:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 106 ms
Attempting to minimize the solution found.
Minimization took 18 ms.
[2020-05-21 01:07:14] [INFO ] [Real]Absence check using 11 positive place invariants in 9 ms returned unsat
[2020-05-21 01:07:14] [INFO ] [Real]Absence check using 11 positive place invariants in 11 ms returned unsat
[2020-05-21 01:07:14] [INFO ] [Real]Absence check using 11 positive place invariants in 11 ms returned sat
[2020-05-21 01:07:14] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 1 ms returned sat
[2020-05-21 01:07:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:07:15] [INFO ] [Real]Absence check using state equation in 197 ms returned sat
[2020-05-21 01:07:15] [INFO ] [Real]Added 66 Read/Feed constraints in 9 ms returned sat
[2020-05-21 01:07:15] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:07:15] [INFO ] [Nat]Absence check using 11 positive place invariants in 20 ms returned sat
[2020-05-21 01:07:15] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2020-05-21 01:07:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:07:15] [INFO ] [Nat]Absence check using state equation in 209 ms returned sat
[2020-05-21 01:07:15] [INFO ] [Nat]Added 66 Read/Feed constraints in 12 ms returned sat
[2020-05-21 01:07:15] [INFO ] Deduced a trap composed of 9 places in 108 ms
[2020-05-21 01:07:15] [INFO ] Deduced a trap composed of 9 places in 83 ms
[2020-05-21 01:07:15] [INFO ] Deduced a trap composed of 9 places in 74 ms
[2020-05-21 01:07:15] [INFO ] Deduced a trap composed of 45 places in 67 ms
[2020-05-21 01:07:15] [INFO ] Deduced a trap composed of 26 places in 63 ms
[2020-05-21 01:07:15] [INFO ] Deduced a trap composed of 26 places in 62 ms
[2020-05-21 01:07:16] [INFO ] Deduced a trap composed of 26 places in 65 ms
[2020-05-21 01:07:16] [INFO ] Deduced a trap composed of 45 places in 50 ms
[2020-05-21 01:07:16] [INFO ] Deduced a trap composed of 45 places in 53 ms
[2020-05-21 01:07:16] [INFO ] Deduced a trap composed of 16 places in 88 ms
[2020-05-21 01:07:16] [INFO ] Deduced a trap composed of 12 places in 90 ms
[2020-05-21 01:07:16] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 984 ms
[2020-05-21 01:07:16] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 19 ms.
[2020-05-21 01:07:17] [INFO ] Added : 303 causal constraints over 61 iterations in 1327 ms. Result :sat
[2020-05-21 01:07:17] [INFO ] Deduced a trap composed of 34 places in 71 ms
[2020-05-21 01:07:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 111 ms
Attempting to minimize the solution found.
Minimization took 13 ms.
FORMULA Peterson-PT-3-ReachabilityCardinality-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-PT-3-ReachabilityCardinality-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-PT-3-ReachabilityCardinality-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-PT-3-ReachabilityCardinality-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-PT-3-ReachabilityCardinality-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 64200 steps, including 790 resets, run finished after 160 ms. (steps per millisecond=401 ) properties seen :[0, 0, 0, 1, 0] could not realise parikh vector
FORMULA Peterson-PT-3-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 14500 steps, including 311 resets, run finished after 31 ms. (steps per millisecond=467 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 72800 steps, including 850 resets, run finished after 120 ms. (steps per millisecond=606 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 61700 steps, including 973 resets, run finished after 88 ms. (steps per millisecond=701 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 54100 steps, including 886 resets, run finished after 82 ms. (steps per millisecond=659 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Support contains 12 out of 244 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 244/244 places, 332/332 transitions.
Performed 92 Post agglomeration using F-continuation condition.Transition count delta: 92
Iterating post reduction 0 with 92 rules applied. Total rules applied 92 place count 244 transition count 240
Reduce places removed 92 places and 0 transitions.
Iterating post reduction 1 with 92 rules applied. Total rules applied 184 place count 152 transition count 240
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 42 Pre rules applied. Total rules applied 184 place count 152 transition count 198
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 268 place count 110 transition count 198
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 290 place count 99 transition count 187
Applied a total of 290 rules in 58 ms. Remains 99 /244 variables (removed 145) and now considering 187/332 (removed 145) transitions.
Finished structural reductions, in 1 iterations. Remains : 99/244 places, 187/332 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 1148 ms. (steps per millisecond=871 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 0 resets, run finished after 342 ms. (steps per millisecond=2923 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 0 resets, run finished after 361 ms. (steps per millisecond=2770 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 0 resets, run finished after 360 ms. (steps per millisecond=2777 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 0 resets, run finished after 486 ms. (steps per millisecond=2057 ) properties seen :[0, 0, 0, 0]
Finished probabilistic random walk after 388350 steps, run visited all 4 properties in 487 ms. (steps per millisecond=797 )
Probabilistic random walk after 388350 steps, saw 77671 distinct states, run finished after 488 ms. (steps per millisecond=795 ) properties seen :[1, 1, 1, 1]
FORMULA Peterson-PT-3-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA Peterson-PT-3-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA Peterson-PT-3-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA Peterson-PT-3-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
BK_STOP 1590023241813
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination ReachabilityCardinality -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6
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="Peterson-PT-3"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itstools"
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 itstools"
echo " Input is Peterson-PT-3, 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 r111-csrt-158961258100718"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Peterson-PT-3.tgz
mv Peterson-PT-3 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 '
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 ;