Execution Chart

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

Trace from the execution

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

--------------------
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 1591163980629

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 05:59:42] [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 05:59:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 05:59:42] [INFO ] Load time of PNML (sax parser for PT used): 109 ms
[2020-06-03 05:59:42] [INFO ] Transformed 244 places.
[2020-06-03 05:59:42] [INFO ] Transformed 332 transitions.
[2020-06-03 05:59:42] [INFO ] Parsed PT model containing 244 places and 332 transitions in 157 ms.
[2020-06-03 05:59:42] [INFO ] Initial state test concluded for 1 properties.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 34 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 75 ms. (steps per millisecond=133 ) properties seen :[1, 0, 0, 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-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 18 ms. (steps per millisecond=555 ) properties seen :[0, 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, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 24 ms. (steps per millisecond=416 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0]
FORMULA Peterson-PT-3-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 45 ms. (steps per millisecond=222 ) 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 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 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 14 ms. (steps per millisecond=714 ) 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 15 ms. (steps per millisecond=666 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
[2020-06-03 05:59:43] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 244 cols
[2020-06-03 05:59:43] [INFO ] Computed 15 place invariants in 11 ms
[2020-06-03 05:59:43] [INFO ] [Real]Absence check using 11 positive place invariants in 31 ms returned unsat
[2020-06-03 05:59:43] [INFO ] [Real]Absence check using 11 positive place invariants in 20 ms returned sat
[2020-06-03 05:59:43] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2020-06-03 05:59:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:59:43] [INFO ] [Real]Absence check using state equation in 291 ms returned sat
[2020-06-03 05:59:43] [INFO ] State equation strengthened by 66 read => feed constraints.
[2020-06-03 05:59:43] [INFO ] [Real]Added 66 Read/Feed constraints in 9 ms returned sat
[2020-06-03 05:59:43] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:59:44] [INFO ] [Nat]Absence check using 11 positive place invariants in 94 ms returned sat
[2020-06-03 05:59:44] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 16 ms returned sat
[2020-06-03 05:59:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:59:44] [INFO ] [Nat]Absence check using state equation in 248 ms returned sat
[2020-06-03 05:59:44] [INFO ] [Nat]Added 66 Read/Feed constraints in 12 ms returned sat
[2020-06-03 05:59:44] [INFO ] Deduced a trap composed of 13 places in 186 ms
[2020-06-03 05:59:44] [INFO ] Deduced a trap composed of 28 places in 197 ms
[2020-06-03 05:59:45] [INFO ] Deduced a trap composed of 13 places in 538 ms
[2020-06-03 05:59:45] [INFO ] Deduced a trap composed of 31 places in 116 ms
[2020-06-03 05:59:45] [INFO ] Deduced a trap composed of 89 places in 119 ms
[2020-06-03 05:59:45] [INFO ] Deduced a trap composed of 9 places in 103 ms
[2020-06-03 05:59:45] [INFO ] Deduced a trap composed of 12 places in 105 ms
[2020-06-03 05:59:46] [INFO ] Deduced a trap composed of 49 places in 138 ms
[2020-06-03 05:59:46] [INFO ] Deduced a trap composed of 9 places in 104 ms
[2020-06-03 05:59:46] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1785 ms
[2020-06-03 05:59:46] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 17 ms.
[2020-06-03 05:59:47] [INFO ] Added : 303 causal constraints over 61 iterations in 1540 ms. Result :sat
[2020-06-03 05:59:47] [INFO ] Deduced a trap composed of 34 places in 151 ms
[2020-06-03 05:59:48] [INFO ] Deduced a trap composed of 31 places in 166 ms
[2020-06-03 05:59:49] [INFO ] Deduced a trap composed of 51 places in 910 ms
[2020-06-03 05:59:49] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s1 s3 s6 s14 s16 s26 s28 s37 s50 s52 s62 s65 s67 s69 s71 s81 s90 s92 s93 s95 s109 s110 s112 s121 s123 s127 s128 s136 s138 s145 s147 s152 s158 s160 s163 s167 s176 s185 s187 s190 s192 s202 s204 s209 s212 s222 s224 s226 s228 s230 s235) 0)") while checking expression at index 1
[2020-06-03 05:59:49] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned unsat
[2020-06-03 05:59:49] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned unsat
[2020-06-03 05:59:49] [INFO ] [Real]Absence check using 11 positive place invariants in 10 ms returned sat
[2020-06-03 05:59:49] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2020-06-03 05:59:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:59:49] [INFO ] [Real]Absence check using state equation in 210 ms returned sat
[2020-06-03 05:59:49] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:59:49] [INFO ] [Nat]Absence check using 11 positive place invariants in 17 ms returned sat
[2020-06-03 05:59:49] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 1 ms returned sat
[2020-06-03 05:59:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:59:49] [INFO ] [Nat]Absence check using state equation in 190 ms returned sat
[2020-06-03 05:59:49] [INFO ] [Nat]Added 66 Read/Feed constraints in 9 ms returned sat
[2020-06-03 05:59:49] [INFO ] Deduced a trap composed of 16 places in 142 ms
[2020-06-03 05:59:49] [INFO ] Deduced a trap composed of 16 places in 55 ms
[2020-06-03 05:59:49] [INFO ] Deduced a trap composed of 41 places in 48 ms
[2020-06-03 05:59:50] [INFO ] Deduced a trap composed of 31 places in 46 ms
[2020-06-03 05:59:50] [INFO ] Deduced a trap composed of 38 places in 45 ms
[2020-06-03 05:59:50] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 430 ms
[2020-06-03 05:59:50] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 15 ms.
[2020-06-03 05:59:51] [INFO ] Added : 304 causal constraints over 61 iterations in 1419 ms. Result :sat
[2020-06-03 05:59:51] [INFO ] Deduced a trap composed of 17 places in 92 ms
[2020-06-03 05:59:51] [INFO ] Deduced a trap composed of 12 places in 79 ms
[2020-06-03 05:59:51] [INFO ] Deduced a trap composed of 9 places in 112 ms
[2020-06-03 05:59:52] [INFO ] Deduced a trap composed of 30 places in 129 ms
[2020-06-03 05:59:52] [INFO ] Deduced a trap composed of 60 places in 119 ms
[2020-06-03 05:59:52] [INFO ] Deduced a trap composed of 65 places in 54 ms
[2020-06-03 05:59:52] [INFO ] Deduced a trap composed of 73 places in 87 ms
[2020-06-03 05:59:52] [INFO ] Deduced a trap composed of 27 places in 93 ms
[2020-06-03 05:59:52] [INFO ] Deduced a trap composed of 30 places in 92 ms
[2020-06-03 05:59:52] [INFO ] Deduced a trap composed of 45 places in 71 ms
[2020-06-03 05:59:52] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1261 ms
Attempting to minimize the solution found.
Minimization took 21 ms.
[2020-06-03 05:59:52] [INFO ] [Real]Absence check using 11 positive place invariants in 9 ms returned sat
[2020-06-03 05:59:52] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 1 ms returned sat
[2020-06-03 05:59:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:59:53] [INFO ] [Real]Absence check using state equation in 220 ms returned sat
[2020-06-03 05:59:53] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:59:53] [INFO ] [Nat]Absence check using 11 positive place invariants in 17 ms returned sat
[2020-06-03 05:59:53] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2020-06-03 05:59:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:59:53] [INFO ] [Nat]Absence check using state equation in 192 ms returned sat
[2020-06-03 05:59:53] [INFO ] [Nat]Added 66 Read/Feed constraints in 17 ms returned sat
[2020-06-03 05:59:53] [INFO ] Deduced a trap composed of 9 places in 108 ms
[2020-06-03 05:59:53] [INFO ] Deduced a trap composed of 31 places in 84 ms
[2020-06-03 05:59:53] [INFO ] Deduced a trap composed of 20 places in 96 ms
[2020-06-03 05:59:53] [INFO ] Deduced a trap composed of 31 places in 76 ms
[2020-06-03 05:59:53] [INFO ] Deduced a trap composed of 52 places in 75 ms
[2020-06-03 05:59:54] [INFO ] Deduced a trap composed of 38 places in 67 ms
[2020-06-03 05:59:54] [INFO ] Deduced a trap composed of 59 places in 91 ms
[2020-06-03 05:59:54] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 695 ms
[2020-06-03 05:59:54] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 18 ms.
[2020-06-03 05:59:55] [INFO ] Added : 304 causal constraints over 61 iterations in 1482 ms. Result :sat
[2020-06-03 05:59:55] [INFO ] Deduced a trap composed of 56 places in 92 ms
[2020-06-03 05:59:55] [INFO ] Deduced a trap composed of 56 places in 86 ms
[2020-06-03 05:59:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 295 ms
Attempting to minimize the solution found.
Minimization took 20 ms.
[2020-06-03 05:59:55] [INFO ] [Real]Absence check using 11 positive place invariants in 15 ms returned sat
[2020-06-03 05:59:55] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2020-06-03 05:59:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:59:56] [INFO ] [Real]Absence check using state equation in 224 ms returned sat
[2020-06-03 05:59:56] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:59:56] [INFO ] [Nat]Absence check using 11 positive place invariants in 12 ms returned sat
[2020-06-03 05:59:56] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2020-06-03 05:59:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:59:56] [INFO ] [Nat]Absence check using state equation in 216 ms returned sat
[2020-06-03 05:59:56] [INFO ] [Nat]Added 66 Read/Feed constraints in 15 ms returned sat
[2020-06-03 05:59:56] [INFO ] Deduced a trap composed of 13 places in 94 ms
[2020-06-03 05:59:56] [INFO ] Deduced a trap composed of 16 places in 92 ms
[2020-06-03 05:59:56] [INFO ] Deduced a trap composed of 13 places in 100 ms
[2020-06-03 05:59:56] [INFO ] Deduced a trap composed of 31 places in 63 ms
[2020-06-03 05:59:56] [INFO ] Deduced a trap composed of 31 places in 54 ms
[2020-06-03 05:59:57] [INFO ] Deduced a trap composed of 38 places in 54 ms
[2020-06-03 05:59:57] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 561 ms
[2020-06-03 05:59:57] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 17 ms.
[2020-06-03 05:59:58] [INFO ] Added : 304 causal constraints over 61 iterations in 1359 ms. Result :sat
[2020-06-03 05:59:58] [INFO ] Deduced a trap composed of 48 places in 93 ms
[2020-06-03 05:59:58] [INFO ] Deduced a trap composed of 49 places in 92 ms
[2020-06-03 05:59:58] [INFO ] Deduced a trap composed of 16 places in 79 ms
[2020-06-03 05:59:58] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 420 ms
Attempting to minimize the solution found.
Minimization took 21 ms.
[2020-06-03 05:59:58] [INFO ] [Real]Absence check using 11 positive place invariants in 12 ms returned unsat
[2020-06-03 05:59:58] [INFO ] [Real]Absence check using 11 positive place invariants in 13 ms returned unsat
[2020-06-03 05:59:59] [INFO ] [Real]Absence check using 11 positive place invariants in 13 ms returned sat
[2020-06-03 05:59:59] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2020-06-03 05:59:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:59:59] [INFO ] [Real]Absence check using state equation in 230 ms returned sat
[2020-06-03 05:59:59] [INFO ] [Real]Added 66 Read/Feed constraints in 9 ms returned sat
[2020-06-03 05:59:59] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:59:59] [INFO ] [Nat]Absence check using 11 positive place invariants in 13 ms returned sat
[2020-06-03 05:59:59] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2020-06-03 05:59:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:59:59] [INFO ] [Nat]Absence check using state equation in 214 ms returned sat
[2020-06-03 05:59:59] [INFO ] [Nat]Added 66 Read/Feed constraints in 19 ms returned sat
[2020-06-03 05:59:59] [INFO ] Deduced a trap composed of 9 places in 114 ms
[2020-06-03 05:59:59] [INFO ] Deduced a trap composed of 9 places in 86 ms
[2020-06-03 05:59:59] [INFO ] Deduced a trap composed of 9 places in 76 ms
[2020-06-03 05:59:59] [INFO ] Deduced a trap composed of 45 places in 81 ms
[2020-06-03 06:00:00] [INFO ] Deduced a trap composed of 26 places in 66 ms
[2020-06-03 06:00:00] [INFO ] Deduced a trap composed of 26 places in 82 ms
[2020-06-03 06:00:00] [INFO ] Deduced a trap composed of 26 places in 63 ms
[2020-06-03 06:00:00] [INFO ] Deduced a trap composed of 45 places in 52 ms
[2020-06-03 06:00:00] [INFO ] Deduced a trap composed of 45 places in 52 ms
[2020-06-03 06:00:00] [INFO ] Deduced a trap composed of 16 places in 72 ms
[2020-06-03 06:00:00] [INFO ] Deduced a trap composed of 12 places in 87 ms
[2020-06-03 06:00:00] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 989 ms
[2020-06-03 06:00:00] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 16 ms.
[2020-06-03 06:00:02] [INFO ] Added : 303 causal constraints over 61 iterations in 1560 ms. Result :sat
[2020-06-03 06:00:02] [INFO ] Deduced a trap composed of 34 places in 98 ms
[2020-06-03 06:00:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 157 ms
Attempting to minimize the solution found.
Minimization took 17 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 793 resets, run finished after 204 ms. (steps per millisecond=314 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 72800 steps, including 849 resets, run finished after 138 ms. (steps per millisecond=527 ) properties seen :[1, 0, 0, 0, 0] could not realise parikh vector
FORMULA Peterson-PT-3-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 61700 steps, including 972 resets, run finished after 87 ms. (steps per millisecond=709 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 54100 steps, including 886 resets, run finished after 115 ms. (steps per millisecond=470 ) 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 107 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 1435 ms. (steps per millisecond=696 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 0 resets, run finished after 374 ms. (steps per millisecond=2673 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 0 resets, run finished after 397 ms. (steps per millisecond=2518 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 0 resets, run finished after 369 ms. (steps per millisecond=2710 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 0 resets, run finished after 519 ms. (steps per millisecond=1926 ) properties seen :[0, 0, 0, 0]
Finished probabilistic random walk after 388350 steps, run visited all 4 properties in 513 ms. (steps per millisecond=757 )
Probabilistic random walk after 388350 steps, saw 77671 distinct states, run finished after 513 ms. (steps per millisecond=757 ) 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.

--------------------
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="Peterson-PT-3"
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 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 r174-csrt-158987853600718"
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 '' 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 ;