fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r174-csrt-158987853600719
Last Updated
Jun 28, 2020

About the Execution of ITS-LoLa for Peterson-PT-3

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15743.670 3600000.00 61043.00 88.80 FTFTTFFTFTTTFTTT 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.r174-csrt-158987853600719.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 ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r174-csrt-158987853600719
=====================================================================

--------------------
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-ReachabilityFireability-00
FORMULA_NAME Peterson-PT-3-ReachabilityFireability-01
FORMULA_NAME Peterson-PT-3-ReachabilityFireability-02
FORMULA_NAME Peterson-PT-3-ReachabilityFireability-03
FORMULA_NAME Peterson-PT-3-ReachabilityFireability-04
FORMULA_NAME Peterson-PT-3-ReachabilityFireability-05
FORMULA_NAME Peterson-PT-3-ReachabilityFireability-06
FORMULA_NAME Peterson-PT-3-ReachabilityFireability-07
FORMULA_NAME Peterson-PT-3-ReachabilityFireability-08
FORMULA_NAME Peterson-PT-3-ReachabilityFireability-09
FORMULA_NAME Peterson-PT-3-ReachabilityFireability-10
FORMULA_NAME Peterson-PT-3-ReachabilityFireability-11
FORMULA_NAME Peterson-PT-3-ReachabilityFireability-12
FORMULA_NAME Peterson-PT-3-ReachabilityFireability-13
FORMULA_NAME Peterson-PT-3-ReachabilityFireability-14
FORMULA_NAME Peterson-PT-3-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1591163988830

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 05:59:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 05:59:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 05:59:51] [INFO ] Load time of PNML (sax parser for PT used): 128 ms
[2020-06-03 05:59:51] [INFO ] Transformed 244 places.
[2020-06-03 05:59:51] [INFO ] Transformed 332 transitions.
[2020-06-03 05:59:51] [INFO ] Parsed PT model containing 244 places and 332 transitions in 217 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 52 ms.
Working with output stream class java.io.PrintStream
FORMULA Peterson-PT-3-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-3-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 0 resets, run finished after 93 ms. (steps per millisecond=107 ) properties seen :[0, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 0, 0, 0]
FORMULA Peterson-PT-3-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-3-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-3-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-3-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-3-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 22 ms. (steps per millisecond=454 ) properties seen :[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, 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, 1, 0, 0, 0, 1]
FORMULA Peterson-PT-3-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Peterson-PT-3-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 32 ms. (steps per millisecond=312 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 33 ms. (steps per millisecond=303 ) properties seen :[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]
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]
[2020-06-03 05:59:51] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 244 cols
[2020-06-03 05:59:51] [INFO ] Computed 15 place invariants in 13 ms
[2020-06-03 05:59:51] [INFO ] [Real]Absence check using 11 positive place invariants in 39 ms returned sat
[2020-06-03 05:59:51] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 4 ms returned sat
[2020-06-03 05:59:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:59:52] [INFO ] [Real]Absence check using state equation in 277 ms returned sat
[2020-06-03 05:59:52] [INFO ] State equation strengthened by 66 read => feed constraints.
[2020-06-03 05:59:52] [INFO ] [Real]Added 66 Read/Feed constraints in 22 ms returned sat
[2020-06-03 05:59:52] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:59:52] [INFO ] [Nat]Absence check using 11 positive place invariants in 18 ms returned sat
[2020-06-03 05:59:52] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2020-06-03 05:59:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:59:52] [INFO ] [Nat]Absence check using state equation in 373 ms returned sat
[2020-06-03 05:59:52] [INFO ] [Nat]Added 66 Read/Feed constraints in 25 ms returned sat
[2020-06-03 05:59:53] [INFO ] Deduced a trap composed of 9 places in 165 ms
[2020-06-03 05:59:53] [INFO ] Deduced a trap composed of 31 places in 107 ms
[2020-06-03 05:59:53] [INFO ] Deduced a trap composed of 31 places in 81 ms
[2020-06-03 05:59:53] [INFO ] Deduced a trap composed of 52 places in 114 ms
[2020-06-03 05:59:53] [INFO ] Deduced a trap composed of 52 places in 122 ms
[2020-06-03 05:59:53] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 720 ms
[2020-06-03 05:59:53] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 24 ms.
[2020-06-03 05:59:55] [INFO ] Added : 304 causal constraints over 61 iterations in 1641 ms. Result :sat
[2020-06-03 05:59:55] [INFO ] Deduced a trap composed of 27 places in 166 ms
[2020-06-03 05:59:55] [INFO ] Deduced a trap composed of 34 places in 136 ms
[2020-06-03 05:59:55] [INFO ] Deduced a trap composed of 13 places in 124 ms
[2020-06-03 05:59:55] [INFO ] Deduced a trap composed of 12 places in 157 ms
[2020-06-03 05:59:56] [INFO ] Deduced a trap composed of 29 places in 108 ms
[2020-06-03 05:59:56] [INFO ] Deduced a trap composed of 49 places in 163 ms
[2020-06-03 05:59:56] [INFO ] Deduced a trap composed of 11 places in 155 ms
[2020-06-03 05:59:56] [INFO ] Deduced a trap composed of 27 places in 142 ms
[2020-06-03 05:59:56] [INFO ] Deduced a trap composed of 9 places in 126 ms
[2020-06-03 05:59:57] [INFO ] Deduced a trap composed of 38 places in 162 ms
[2020-06-03 05:59:57] [INFO ] Deduced a trap composed of 27 places in 110 ms
[2020-06-03 05:59:57] [INFO ] Deduced a trap composed of 45 places in 141 ms
[2020-06-03 05:59:57] [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 (> (+ s0 s4 s12 s15 s23 s27 s45 s50 s57 s67 s68 s72 s76 s79 s91 s94 s98 s110 s113 s123 s125 s130 s134 s135 s144 s147 s148 s151 s154 s157 s158 s169 s178 s182 s186 s191 s195 s203 s207 s212 s222 s225 s226 s229 s235) 0)") while checking expression at index 0
[2020-06-03 05:59:57] [INFO ] [Real]Absence check using 11 positive place invariants in 19 ms returned sat
[2020-06-03 05:59:57] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 3 ms returned sat
[2020-06-03 05:59:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:59:58] [INFO ] [Real]Absence check using state equation in 459 ms returned sat
[2020-06-03 05:59:58] [INFO ] [Real]Added 66 Read/Feed constraints in 42 ms returned sat
[2020-06-03 05:59:58] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:59:58] [INFO ] [Nat]Absence check using 11 positive place invariants in 20 ms returned sat
[2020-06-03 05:59:58] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 3 ms returned sat
[2020-06-03 05:59:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:59:58] [INFO ] [Nat]Absence check using state equation in 240 ms returned sat
[2020-06-03 05:59:58] [INFO ] [Nat]Added 66 Read/Feed constraints in 47 ms returned sat
[2020-06-03 05:59:58] [INFO ] Deduced a trap composed of 9 places in 143 ms
[2020-06-03 05:59:58] [INFO ] Deduced a trap composed of 31 places in 72 ms
[2020-06-03 05:59:58] [INFO ] Deduced a trap composed of 31 places in 76 ms
[2020-06-03 05:59:58] [INFO ] Deduced a trap composed of 52 places in 82 ms
[2020-06-03 05:59:58] [INFO ] Deduced a trap composed of 52 places in 69 ms
[2020-06-03 05:59:58] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 522 ms
[2020-06-03 05:59:58] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 16 ms.
[2020-06-03 06:00:00] [INFO ] Added : 304 causal constraints over 61 iterations in 1444 ms. Result :sat
[2020-06-03 06:00:00] [INFO ] Deduced a trap composed of 27 places in 139 ms
[2020-06-03 06:00:00] [INFO ] Deduced a trap composed of 34 places in 129 ms
[2020-06-03 06:00:00] [INFO ] Deduced a trap composed of 13 places in 121 ms
[2020-06-03 06:00:01] [INFO ] Deduced a trap composed of 12 places in 157 ms
[2020-06-03 06:00:01] [INFO ] Deduced a trap composed of 29 places in 120 ms
[2020-06-03 06:00:01] [INFO ] Deduced a trap composed of 49 places in 156 ms
[2020-06-03 06:00:01] [INFO ] Deduced a trap composed of 11 places in 166 ms
[2020-06-03 06:00:01] [INFO ] Deduced a trap composed of 27 places in 130 ms
[2020-06-03 06:00:02] [INFO ] Deduced a trap composed of 9 places in 133 ms
[2020-06-03 06:00:02] [INFO ] Deduced a trap composed of 38 places in 122 ms
[2020-06-03 06:00:02] [INFO ] Deduced a trap composed of 27 places in 93 ms
[2020-06-03 06:00:02] [INFO ] Deduced a trap composed of 45 places in 129 ms
[2020-06-03 06:00:02] [INFO ] Deduced a trap composed of 37 places in 87 ms
[2020-06-03 06:00:02] [INFO ] Deduced a trap composed of 13 places in 115 ms
[2020-06-03 06:00:03] [INFO ] Deduced a trap composed of 61 places in 65 ms
[2020-06-03 06:00:03] [INFO ] Deduced a trap composed of 16 places in 130 ms
[2020-06-03 06:00:03] [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 (> (+ s0 s12 s57 s76 s79 s111 s125 s134 s144 s169 s178 s182 s206 s211 s227 s236) 0)") while checking expression at index 1
[2020-06-03 06:00:03] [INFO ] [Real]Absence check using 11 positive place invariants in 16 ms returned sat
[2020-06-03 06:00:03] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 3 ms returned sat
[2020-06-03 06:00:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:00:03] [INFO ] [Real]Absence check using state equation in 306 ms returned sat
[2020-06-03 06:00:03] [INFO ] [Real]Added 66 Read/Feed constraints in 10 ms returned sat
[2020-06-03 06:00:03] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:00:03] [INFO ] [Nat]Absence check using 11 positive place invariants in 15 ms returned sat
[2020-06-03 06:00:03] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 3 ms returned sat
[2020-06-03 06:00:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:00:03] [INFO ] [Nat]Absence check using state equation in 232 ms returned sat
[2020-06-03 06:00:03] [INFO ] [Nat]Added 66 Read/Feed constraints in 13 ms returned sat
[2020-06-03 06:00:04] [INFO ] Deduced a trap composed of 9 places in 183 ms
[2020-06-03 06:00:04] [INFO ] Deduced a trap composed of 31 places in 124 ms
[2020-06-03 06:00:04] [INFO ] Deduced a trap composed of 31 places in 122 ms
[2020-06-03 06:00:04] [INFO ] Deduced a trap composed of 52 places in 95 ms
[2020-06-03 06:00:04] [INFO ] Deduced a trap composed of 52 places in 123 ms
[2020-06-03 06:00:04] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 749 ms
[2020-06-03 06:00:04] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 66 ms.
[2020-06-03 06:00:06] [INFO ] Added : 304 causal constraints over 61 iterations in 1513 ms. Result :sat
[2020-06-03 06:00:06] [INFO ] Deduced a trap composed of 27 places in 155 ms
[2020-06-03 06:00:06] [INFO ] Deduced a trap composed of 34 places in 196 ms
[2020-06-03 06:00:06] [INFO ] Deduced a trap composed of 13 places in 127 ms
[2020-06-03 06:00:07] [INFO ] Deduced a trap composed of 12 places in 124 ms
[2020-06-03 06:00:07] [INFO ] Deduced a trap composed of 29 places in 132 ms
[2020-06-03 06:00:07] [INFO ] Deduced a trap composed of 49 places in 99 ms
[2020-06-03 06:00:07] [INFO ] Deduced a trap composed of 11 places in 123 ms
[2020-06-03 06:00:07] [INFO ] Deduced a trap composed of 27 places in 116 ms
[2020-06-03 06:00:07] [INFO ] Deduced a trap composed of 9 places in 256 ms
[2020-06-03 06:00:08] [INFO ] Deduced a trap composed of 38 places in 121 ms
[2020-06-03 06:00:08] [INFO ] Deduced a trap composed of 27 places in 93 ms
[2020-06-03 06:00:08] [INFO ] Deduced a trap composed of 45 places in 97 ms
[2020-06-03 06:00:08] [INFO ] Deduced a trap composed of 37 places in 109 ms
[2020-06-03 06:00:08] [INFO ] Deduced a trap composed of 13 places in 116 ms
[2020-06-03 06:00:08] [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 (> (+ s2 s66 s70 s112 s124 s133 s146 s159 s188 s211 s216 s228 s236) 0)") while checking expression at index 2
[2020-06-03 06:00:08] [INFO ] [Real]Absence check using 11 positive place invariants in 13 ms returned sat
[2020-06-03 06:00:08] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2020-06-03 06:00:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:00:08] [INFO ] [Real]Absence check using state equation in 204 ms returned sat
[2020-06-03 06:00:08] [INFO ] [Real]Added 66 Read/Feed constraints in 19 ms returned sat
[2020-06-03 06:00:08] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:00:09] [INFO ] [Nat]Absence check using 11 positive place invariants in 13 ms returned sat
[2020-06-03 06:00:09] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 1 ms returned sat
[2020-06-03 06:00:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:00:09] [INFO ] [Nat]Absence check using state equation in 231 ms returned sat
[2020-06-03 06:00:09] [INFO ] [Nat]Added 66 Read/Feed constraints in 13 ms returned sat
[2020-06-03 06:00:09] [INFO ] Deduced a trap composed of 31 places in 121 ms
[2020-06-03 06:00:09] [INFO ] Deduced a trap composed of 52 places in 96 ms
[2020-06-03 06:00:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 256 ms
[2020-06-03 06:00:09] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 17 ms.
[2020-06-03 06:00:11] [INFO ] Added : 303 causal constraints over 61 iterations in 2112 ms. Result :sat
[2020-06-03 06:00:12] [INFO ] Deduced a trap composed of 30 places in 497 ms
[2020-06-03 06:00:12] [INFO ] Deduced a trap composed of 49 places in 139 ms
[2020-06-03 06:00:12] [INFO ] Deduced a trap composed of 12 places in 74 ms
[2020-06-03 06:00:12] [INFO ] Deduced a trap composed of 16 places in 136 ms
[2020-06-03 06:00:12] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1029 ms
Attempting to minimize the solution found.
Minimization took 45 ms.
[2020-06-03 06:00:12] [INFO ] [Real]Absence check using 11 positive place invariants in 11 ms returned sat
[2020-06-03 06:00:12] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 5 ms returned sat
[2020-06-03 06:00:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:00:13] [INFO ] [Real]Absence check using state equation in 230 ms returned sat
[2020-06-03 06:00:13] [INFO ] [Real]Added 66 Read/Feed constraints in 9 ms returned sat
[2020-06-03 06:00:13] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:00:13] [INFO ] [Nat]Absence check using 11 positive place invariants in 17 ms returned sat
[2020-06-03 06:00:13] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2020-06-03 06:00:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:00:13] [INFO ] [Nat]Absence check using state equation in 217 ms returned sat
[2020-06-03 06:00:13] [INFO ] [Nat]Added 66 Read/Feed constraints in 12 ms returned sat
[2020-06-03 06:00:13] [INFO ] Deduced a trap composed of 33 places in 269 ms
[2020-06-03 06:00:13] [INFO ] Deduced a trap composed of 23 places in 141 ms
[2020-06-03 06:00:14] [INFO ] Deduced a trap composed of 31 places in 117 ms
[2020-06-03 06:00:14] [INFO ] Deduced a trap composed of 23 places in 97 ms
[2020-06-03 06:00:14] [INFO ] Deduced a trap composed of 40 places in 161 ms
[2020-06-03 06:00:14] [INFO ] Deduced a trap composed of 26 places in 162 ms
[2020-06-03 06:00:14] [INFO ] Deduced a trap composed of 13 places in 117 ms
[2020-06-03 06:00:14] [INFO ] Deduced a trap composed of 13 places in 125 ms
[2020-06-03 06:00:14] [INFO ] Deduced a trap composed of 38 places in 109 ms
[2020-06-03 06:00:15] [INFO ] Deduced a trap composed of 9 places in 184 ms
[2020-06-03 06:00:15] [INFO ] Deduced a trap composed of 34 places in 91 ms
[2020-06-03 06:00:15] [INFO ] Deduced a trap composed of 12 places in 129 ms
[2020-06-03 06:00:15] [INFO ] Deduced a trap composed of 87 places in 84 ms
[2020-06-03 06:00:15] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 2045 ms
[2020-06-03 06:00:15] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 16 ms.
[2020-06-03 06:00:16] [INFO ] Added : 304 causal constraints over 61 iterations in 1384 ms. Result :sat
[2020-06-03 06:00:17] [INFO ] Deduced a trap composed of 34 places in 110 ms
[2020-06-03 06:00:17] [INFO ] Deduced a trap composed of 48 places in 103 ms
[2020-06-03 06:00:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 303 ms
Attempting to minimize the solution found.
Minimization took 14 ms.
[2020-06-03 06:00:17] [INFO ] [Real]Absence check using 11 positive place invariants in 15 ms returned sat
[2020-06-03 06:00:17] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 7 ms returned sat
[2020-06-03 06:00:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:00:17] [INFO ] [Real]Absence check using state equation in 209 ms returned sat
[2020-06-03 06:00:17] [INFO ] [Real]Added 66 Read/Feed constraints in 10 ms returned sat
[2020-06-03 06:00:17] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:00:17] [INFO ] [Nat]Absence check using 11 positive place invariants in 33 ms returned sat
[2020-06-03 06:00:17] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 3 ms returned sat
[2020-06-03 06:00:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:00:17] [INFO ] [Nat]Absence check using state equation in 236 ms returned sat
[2020-06-03 06:00:17] [INFO ] [Nat]Added 66 Read/Feed constraints in 18 ms returned sat
[2020-06-03 06:00:18] [INFO ] Deduced a trap composed of 23 places in 118 ms
[2020-06-03 06:00:18] [INFO ] Deduced a trap composed of 23 places in 98 ms
[2020-06-03 06:00:18] [INFO ] Deduced a trap composed of 9 places in 153 ms
[2020-06-03 06:00:18] [INFO ] Deduced a trap composed of 9 places in 131 ms
[2020-06-03 06:00:18] [INFO ] Deduced a trap composed of 25 places in 130 ms
[2020-06-03 06:00:18] [INFO ] Deduced a trap composed of 16 places in 85 ms
[2020-06-03 06:00:18] [INFO ] Deduced a trap composed of 31 places in 107 ms
[2020-06-03 06:00:19] [INFO ] Deduced a trap composed of 25 places in 135 ms
[2020-06-03 06:00:19] [INFO ] Deduced a trap composed of 27 places in 99 ms
[2020-06-03 06:00:19] [INFO ] Deduced a trap composed of 9 places in 173 ms
[2020-06-03 06:00:19] [INFO ] Deduced a trap composed of 26 places in 120 ms
[2020-06-03 06:00:19] [INFO ] Deduced a trap composed of 26 places in 188 ms
[2020-06-03 06:00:19] [INFO ] Deduced a trap composed of 45 places in 64 ms
[2020-06-03 06:00:19] [INFO ] Deduced a trap composed of 27 places in 84 ms
[2020-06-03 06:00:19] [INFO ] Deduced a trap composed of 34 places in 86 ms
[2020-06-03 06:00:20] [INFO ] Deduced a trap composed of 34 places in 77 ms
[2020-06-03 06:00:20] [INFO ] Deduced a trap composed of 16 places in 68 ms
[2020-06-03 06:00:20] [INFO ] Deduced a trap composed of 27 places in 94 ms
[2020-06-03 06:00:20] [INFO ] Deduced a trap composed of 45 places in 62 ms
[2020-06-03 06:00:20] [INFO ] Deduced a trap composed of 45 places in 56 ms
[2020-06-03 06:00:20] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 2548 ms
[2020-06-03 06:00:20] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 16 ms.
[2020-06-03 06:00:21] [INFO ] Added : 303 causal constraints over 61 iterations in 1522 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 23 ms.
[2020-06-03 06:00:22] [INFO ] [Real]Absence check using 11 positive place invariants in 16 ms returned sat
[2020-06-03 06:00:22] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 3 ms returned sat
[2020-06-03 06:00:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:00:22] [INFO ] [Real]Absence check using state equation in 207 ms returned sat
[2020-06-03 06:00:22] [INFO ] [Real]Added 66 Read/Feed constraints in 15 ms returned sat
[2020-06-03 06:00:22] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:00:22] [INFO ] [Nat]Absence check using 11 positive place invariants in 19 ms returned sat
[2020-06-03 06:00:22] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2020-06-03 06:00:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:00:22] [INFO ] [Nat]Absence check using state equation in 261 ms returned sat
[2020-06-03 06:00:22] [INFO ] [Nat]Added 66 Read/Feed constraints in 13 ms returned sat
[2020-06-03 06:00:22] [INFO ] Deduced a trap composed of 13 places in 125 ms
[2020-06-03 06:00:22] [INFO ] Deduced a trap composed of 18 places in 104 ms
[2020-06-03 06:00:23] [INFO ] Deduced a trap composed of 30 places in 123 ms
[2020-06-03 06:00:23] [INFO ] Deduced a trap composed of 31 places in 90 ms
[2020-06-03 06:00:23] [INFO ] Deduced a trap composed of 34 places in 122 ms
[2020-06-03 06:00:23] [INFO ] Deduced a trap composed of 30 places in 102 ms
[2020-06-03 06:00:23] [INFO ] Deduced a trap composed of 17 places in 88 ms
[2020-06-03 06:00:23] [INFO ] Deduced a trap composed of 31 places in 68 ms
[2020-06-03 06:00:23] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 922 ms
[2020-06-03 06:00:23] [INFO ] Computed and/alt/rep : 328/884/304 causal constraints in 17 ms.
[2020-06-03 06:00:25] [INFO ] Added : 303 causal constraints over 61 iterations in 1664 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 16 ms.
Incomplete Parikh walk after 59500 steps, including 763 resets, run finished after 164 ms. (steps per millisecond=362 ) properties seen :[1, 1, 1, 0, 0, 0, 0] could not realise parikh vector
FORMULA Peterson-PT-3-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Peterson-PT-3-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Peterson-PT-3-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 71400 steps, including 817 resets, run finished after 152 ms. (steps per millisecond=469 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 78300 steps, including 859 resets, run finished after 148 ms. (steps per millisecond=529 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 47000 steps, including 674 resets, run finished after 81 ms. (steps per millisecond=580 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Support contains 18 out of 244 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 244/244 places, 332/332 transitions.
Performed 86 Post agglomeration using F-continuation condition.Transition count delta: 86
Iterating post reduction 0 with 86 rules applied. Total rules applied 86 place count 244 transition count 246
Reduce places removed 86 places and 0 transitions.
Iterating post reduction 1 with 86 rules applied. Total rules applied 172 place count 158 transition count 246
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 45 Pre rules applied. Total rules applied 172 place count 158 transition count 201
Deduced a syphon composed of 45 places in 1 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 2 with 90 rules applied. Total rules applied 262 place count 113 transition count 201
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 286 place count 101 transition count 189
Applied a total of 286 rules in 86 ms. Remains 101 /244 variables (removed 143) and now considering 189/332 (removed 143) transitions.
Finished structural reductions, in 1 iterations. Remains : 101/244 places, 189/332 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 1265 ms. (steps per millisecond=790 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 0 resets, run finished after 646 ms. (steps per millisecond=1547 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 0 resets, run finished after 476 ms. (steps per millisecond=2100 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 0 resets, run finished after 884 ms. (steps per millisecond=1131 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 0 resets, run finished after 478 ms. (steps per millisecond=2092 ) properties seen :[0, 0, 0, 0]
Finished probabilistic random walk after 177028 steps, run visited all 4 properties in 226 ms. (steps per millisecond=783 )
Probabilistic random walk after 177028 steps, saw 35406 distinct states, run finished after 226 ms. (steps per millisecond=783 ) properties seen :[1, 1, 1, 1]
FORMULA Peterson-PT-3-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA Peterson-PT-3-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA Peterson-PT-3-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA Peterson-PT-3-ReachabilityFireability-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="ReachabilityFireability"
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 ReachabilityFireability"
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-158987853600719"
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 [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;