About the Execution of 2020-gold for BridgeAndVehicles-PT-V80P50N10
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
4294.464 | 3600000.00 | 202957.00 | 158.20 | FFFF?TTTFTTTTFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2021-input.r037-tajo-162038176900151.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2021-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 gold2020
Input is BridgeAndVehicles-PT-V80P50N10, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r037-tajo-162038176900151
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 111K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 495K May 10 09:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4M May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 9.2M May 10 09:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 12K Mar 28 15:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 43K Mar 28 15:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 142K Mar 28 15:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 424K Mar 28 15:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Mar 23 02:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 51K Mar 23 02:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 137K Mar 22 11:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 403K Mar 22 11:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.4K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 10 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 2.3M May 5 16:51 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 BridgeAndVehicles-PT-V80P50N10-ReachabilityCardinality-00
FORMULA_NAME BridgeAndVehicles-PT-V80P50N10-ReachabilityCardinality-01
FORMULA_NAME BridgeAndVehicles-PT-V80P50N10-ReachabilityCardinality-02
FORMULA_NAME BridgeAndVehicles-PT-V80P50N10-ReachabilityCardinality-03
FORMULA_NAME BridgeAndVehicles-PT-V80P50N10-ReachabilityCardinality-04
FORMULA_NAME BridgeAndVehicles-PT-V80P50N10-ReachabilityCardinality-05
FORMULA_NAME BridgeAndVehicles-PT-V80P50N10-ReachabilityCardinality-06
FORMULA_NAME BridgeAndVehicles-PT-V80P50N10-ReachabilityCardinality-07
FORMULA_NAME BridgeAndVehicles-PT-V80P50N10-ReachabilityCardinality-08
FORMULA_NAME BridgeAndVehicles-PT-V80P50N10-ReachabilityCardinality-09
FORMULA_NAME BridgeAndVehicles-PT-V80P50N10-ReachabilityCardinality-10
FORMULA_NAME BridgeAndVehicles-PT-V80P50N10-ReachabilityCardinality-11
FORMULA_NAME BridgeAndVehicles-PT-V80P50N10-ReachabilityCardinality-12
FORMULA_NAME BridgeAndVehicles-PT-V80P50N10-ReachabilityCardinality-13
FORMULA_NAME BridgeAndVehicles-PT-V80P50N10-ReachabilityCardinality-14
FORMULA_NAME BridgeAndVehicles-PT-V80P50N10-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1620934886652
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-13 19:41:28] [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]
[2021-05-13 19:41:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 19:41:28] [INFO ] Load time of PNML (sax parser for PT used): 142 ms
[2021-05-13 19:41:28] [INFO ] Transformed 188 places.
[2021-05-13 19:41:28] [INFO ] Transformed 2108 transitions.
[2021-05-13 19:41:28] [INFO ] Parsed PT model containing 188 places and 2108 transitions in 204 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 82 ms.
Working with output stream class java.io.PrintStream
FORMULA BridgeAndVehicles-PT-V80P50N10-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 14 resets, run finished after 213 ms. (steps per millisecond=46 ) properties seen :[1, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 1]
FORMULA BridgeAndVehicles-PT-V80P50N10-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V80P50N10-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V80P50N10-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V80P50N10-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V80P50N10-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 44 ms. (steps per millisecond=227 ) properties seen :[1, 0, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA BridgeAndVehicles-PT-V80P50N10-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 3 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 10001 steps, including 5 resets, run finished after 26 ms. (steps per millisecond=384 ) properties seen :[0, 0, 1, 0, 0, 0, 0, 0, 0]
FORMULA BridgeAndVehicles-PT-V80P50N10-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 24 ms. (steps per millisecond=416 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 22 ms. (steps per millisecond=454 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 26 ms. (steps per millisecond=384 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 34 ms. (steps per millisecond=294 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 27 ms. (steps per millisecond=370 ) properties seen :[0, 0, 0, 0, 0, 0, 1, 0]
FORMULA BridgeAndVehicles-PT-V80P50N10-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 33 ms. (steps per millisecond=303 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
[2021-05-13 19:41:29] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 188 cols
[2021-05-13 19:41:29] [INFO ] Computed 7 place invariants in 20 ms
[2021-05-13 19:41:29] [INFO ] [Real]Absence check using 7 positive place invariants in 11 ms returned unsat
[2021-05-13 19:41:29] [INFO ] [Real]Absence check using 7 positive place invariants in 10 ms returned sat
[2021-05-13 19:41:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 19:41:29] [INFO ] [Real]Absence check using state equation in 156 ms returned sat
[2021-05-13 19:41:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 19:41:29] [INFO ] [Nat]Absence check using 7 positive place invariants in 19 ms returned sat
[2021-05-13 19:41:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 19:41:30] [INFO ] [Nat]Absence check using state equation in 180 ms returned sat
[2021-05-13 19:41:30] [INFO ] State equation strengthened by 22 read => feed constraints.
[2021-05-13 19:41:30] [INFO ] [Nat]Added 22 Read/Feed constraints in 70 ms returned sat
[2021-05-13 19:41:30] [INFO ] Computed and/alt/rep : 2105/40609/367 causal constraints in 151 ms.
[2021-05-13 19:41:34] [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: Broken pipe (=> (> t119 0) (and (or (and (> t247 0) (< o247 o119)) (and (> t249 0) (< o249 o119)) (and (> t251 0) (< o251 o119)) (and (> t253 0) (< o253 o119)) (and (> t255 0) (< o255 o119)) (and (> t257 0) (< o257 o119)) (and (> t259 0) (< o259 o119)) (and (> t261 0) (< o261 o119)) (and (> t263 0) (< o263 o119)) (and (> t265 0) (< o265 o119))) (or (and (> t120 0) (< o120 o119)) (and (> t202 0) (< o202 o119))) (or (and (> t165 0) (< o165 o119)) (and (> t166 0) (< o166 o119)) (and (> t167 0) (< o167 o119)) (and (> t168 0) (< o168 o119)) (and (> t169 0) (< o169 o119)) (and (> t170 0) (< o170 o119)) (and (> t171 0) (< o171 o119)) (and (> t172 0) (< o172 o119)) (and (> t173 0) (< o173 o119)) (and (> t174 0) (< o174 o119)) (and (> t175 0) (< o175 o119)) (and (> t176 0) (< o176 o119)) (and (> t177 0) (< o177 o119)) (and (> t178 0) (< o178 o119)) (and (> t179 0) (< o179 o119)) (and (> t180 0) (< o180 o119)) (and (> t181 0) (< o181 o119)) (and (> t182 0) (< o182 o119)) (and (> t183 0) (< o183 o119)) (and (> t184 0) (< o184 o119)) (and (> t185 0) (< o185 o119)) (and (> t186 0) (< o186 o119)) (and (> t187 0) (< o187 o119)) (and (> t188 0) (< o188 o119)) (and (> t189 0) (< o189 o119)) (and (> t190 0) (< o190 o119)) (and (> t191 0) (< o191 o119)) (and (> t192 0) (< o192 o119)) (and (> t193 0) (< o193 o119)) (and (> t194 0) (< o194 o119)) (and (> t195 0) (< o195 o119)) (and (> t196 0) (< o196 o119)) (and (> t197 0) (< o197 o119)) (and (> t198 0) (< o198 o119)) (and (> t199 0) (< o199 o119)) (and (> t200 0) (< o200 o119)) (and (> t201 0) (< o201 o119)) (and (> t202 0) (< o202 o119)) (and (> t203 0) (< o203 o119)) (and (> t204 0) (< o204 o119)) (and (> t205 0) (< o205 o119)) (and (> t206 0) (< o206 o119)) (and (> t207 0) (< o207 o119)) (and (> t208 0) (< o208 o119)) (and (> t209 0) (< o209 o119)) (and (> t210 0) (< o210 o119)) (and (> t211 0) (< o211 o119)) (and (> t212 0) (< o212 o119)) (and (> t213 0) (< o213 o119)) (and (> t214 0) (< o214 o119)) (and (> t215 0) (< o215 o119)) (and (> t216 0) (< o216 o119)) (and (> t217 0) (< o217 o119)) (and (> t218 0) (< o218 o119)) (and (> t219 0) (< o219 o119)) (and (> t220 0) (< o220 o119)) (and (> t221 0) (< o221 o119)) (and (> t222 0) (< o222 o119)) (and (> t223 0) (< o223 o119)) (and (> t224 0) (< o224 o119)) (and (> t225 0) (< o225 o119)) (and (> t226 0) (< o226 o119)) (and (> t227 0) (< o227 o119)) (and (> t228 0) (< o228 o119)) (and (> t229 0) (< o229 o119)) (and (> t230 0) (< o230 o119)) (and (> t231 0) (< o231 o119)) (and (> t232 0) (< o232 o119)) (and (> t233 0) (< o233 o119)) (and (> t234 0) (< o234 o119)) (and (> t235 0) (< o235 o119)) (and (> t236 0) (< o236 o119)) (and (> t237 0) (< o237 o119)) (and (> t238 0) (< o238 o119)) (and (> t239 0) (< o239 o119)) (and (> t240 0) (< o240 o119)) (and (> t241 0) (< o241 o119)) (and (> t242 0) (< o242 o119)) (and (> t243 0) (< o243 o119)) (and (> t244 0) (< o244 o119)) (and (> t245 0) (< o245 o119)))))") while checking expression at index 1
[2021-05-13 19:41:35] [INFO ] [Real]Absence check using 7 positive place invariants in 53 ms returned unsat
[2021-05-13 19:41:35] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned unsat
[2021-05-13 19:41:35] [INFO ] [Real]Absence check using 7 positive place invariants in 17 ms returned unsat
[2021-05-13 19:41:35] [INFO ] [Real]Absence check using 7 positive place invariants in 30 ms returned unsat
[2021-05-13 19:41:35] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned unsat
FORMULA BridgeAndVehicles-PT-V80P50N10-ReachabilityCardinality-13 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-PT-V80P50N10-ReachabilityCardinality-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-PT-V80P50N10-ReachabilityCardinality-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-PT-V80P50N10-ReachabilityCardinality-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-PT-V80P50N10-ReachabilityCardinality-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-PT-V80P50N10-ReachabilityCardinality-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Support contains 3 out of 188 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 188/188 places, 2108/2108 transitions.
Discarding 2 places :
Also discarding 0 output transitions
Graph (complete) has 1882 edges and 188 vertex of which 186 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.26 ms
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 186 transition count 2108
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 185 transition count 2107
Applied a total of 4 rules in 560 ms. Remains 185 /188 variables (removed 3) and now considering 2107/2108 (removed 1) transitions.
[2021-05-13 19:41:35] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2021-05-13 19:41:35] [INFO ] Computed 5 place invariants in 7 ms
[2021-05-13 19:41:38] [INFO ] Dead Transitions using invariants and state equation in 2530 ms returned []
Finished structural reductions, in 1 iterations. Remains : 185/188 places, 2107/2108 transitions.
Incomplete random walk after 1000000 steps, including 1423 resets, run finished after 5718 ms. (steps per millisecond=174 ) properties seen :[0]
Incomplete Best-First random walk after 1000000 steps, including 544 resets, run finished after 2241 ms. (steps per millisecond=446 ) properties seen :[0]
Interrupted probabilistic random walk after 4777187 steps, run timeout after 30001 ms. (steps per millisecond=159 ) properties seen :[0]
Probabilistic random walk after 4777187 steps, saw 1282548 distinct states, run finished after 30001 ms. (steps per millisecond=159 ) properties seen :[0]
[2021-05-13 19:42:16] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2021-05-13 19:42:16] [INFO ] Computed 5 place invariants in 2 ms
[2021-05-13 19:42:16] [INFO ] [Real]Absence check using 5 positive place invariants in 9 ms returned sat
[2021-05-13 19:42:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 19:42:16] [INFO ] [Real]Absence check using state equation in 182 ms returned sat
[2021-05-13 19:42:16] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 19:42:16] [INFO ] [Nat]Absence check using 5 positive place invariants in 14 ms returned sat
[2021-05-13 19:42:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 19:42:16] [INFO ] [Nat]Absence check using state equation in 187 ms returned sat
[2021-05-13 19:42:16] [INFO ] State equation strengthened by 22 read => feed constraints.
[2021-05-13 19:42:16] [INFO ] [Nat]Added 22 Read/Feed constraints in 134 ms returned sat
[2021-05-13 19:42:17] [INFO ] Computed and/alt/rep : 2104/40609/366 causal constraints in 152 ms.
[2021-05-13 19:42:38] [INFO ] Added : 260 causal constraints over 52 iterations in 21187 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 272 ms.
Incomplete Parikh walk after 66600 steps, including 654 resets, run finished after 362 ms. (steps per millisecond=183 ) properties seen :[0] could not realise parikh vector
Support contains 3 out of 185 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 185/185 places, 2107/2107 transitions.
Applied a total of 0 rules in 246 ms. Remains 185 /185 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 185/185 places, 2107/2107 transitions.
Starting structural reductions, iteration 0 : 185/185 places, 2107/2107 transitions.
Applied a total of 0 rules in 196 ms. Remains 185 /185 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
[2021-05-13 19:42:39] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2021-05-13 19:42:39] [INFO ] Computed 5 place invariants in 2 ms
[2021-05-13 19:42:39] [INFO ] Implicit Places using invariants in 379 ms returned []
[2021-05-13 19:42:39] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2021-05-13 19:42:39] [INFO ] Computed 5 place invariants in 2 ms
[2021-05-13 19:42:39] [INFO ] State equation strengthened by 22 read => feed constraints.
[2021-05-13 19:42:41] [INFO ] Implicit Places using invariants and state equation in 1530 ms returned [82, 168]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1919 ms to find 2 implicit places.
[2021-05-13 19:42:41] [INFO ] Redundant transitions in 195 ms returned []
[2021-05-13 19:42:41] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2021-05-13 19:42:41] [INFO ] Computed 5 place invariants in 3 ms
[2021-05-13 19:42:53] [INFO ] Dead Transitions using invariants and state equation in 11837 ms returned []
Starting structural reductions, iteration 1 : 183/185 places, 2107/2107 transitions.
Applied a total of 0 rules in 167 ms. Remains 183 /183 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
[2021-05-13 19:42:53] [INFO ] Redundant transitions in 125 ms returned []
[2021-05-13 19:42:53] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2021-05-13 19:42:53] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-13 19:42:55] [INFO ] Dead Transitions using invariants and state equation in 1634 ms returned []
Finished structural reductions, in 2 iterations. Remains : 183/185 places, 2107/2107 transitions.
Incomplete random walk after 1000000 steps, including 1423 resets, run finished after 5251 ms. (steps per millisecond=190 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 544 resets, run finished after 2115 ms. (steps per millisecond=472 ) properties seen :[0]
Interrupted probabilistic random walk after 5148587 steps, run timeout after 30001 ms. (steps per millisecond=171 ) properties seen :[0]
Probabilistic random walk after 5148587 steps, saw 1381992 distinct states, run finished after 30003 ms. (steps per millisecond=171 ) properties seen :[0]
[2021-05-13 19:43:32] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2021-05-13 19:43:32] [INFO ] Computed 5 place invariants in 14 ms
[2021-05-13 19:43:32] [INFO ] [Real]Absence check using 5 positive place invariants in 14 ms returned sat
[2021-05-13 19:43:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 19:43:32] [INFO ] [Real]Absence check using state equation in 247 ms returned sat
[2021-05-13 19:43:32] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 19:43:32] [INFO ] [Nat]Absence check using 5 positive place invariants in 14 ms returned sat
[2021-05-13 19:43:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 19:43:33] [INFO ] [Nat]Absence check using state equation in 478 ms returned sat
[2021-05-13 19:43:33] [INFO ] State equation strengthened by 22 read => feed constraints.
[2021-05-13 19:43:33] [INFO ] [Nat]Added 22 Read/Feed constraints in 64 ms returned sat
[2021-05-13 19:43:33] [INFO ] Computed and/alt/rep : 2104/27649/366 causal constraints in 71 ms.
[2021-05-13 19:43:49] [INFO ] Added : 364 causal constraints over 73 iterations in 15600 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 217 ms.
Incomplete Parikh walk after 54500 steps, including 482 resets, run finished after 224 ms. (steps per millisecond=243 ) properties seen :[0] could not realise parikh vector
Support contains 3 out of 183 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 183/183 places, 2107/2107 transitions.
Applied a total of 0 rules in 165 ms. Remains 183 /183 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 183/183 places, 2107/2107 transitions.
Starting structural reductions, iteration 0 : 183/183 places, 2107/2107 transitions.
Applied a total of 0 rules in 159 ms. Remains 183 /183 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
[2021-05-13 19:43:50] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2021-05-13 19:43:50] [INFO ] Computed 5 place invariants in 2 ms
[2021-05-13 19:43:50] [INFO ] Implicit Places using invariants in 394 ms returned []
[2021-05-13 19:43:50] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2021-05-13 19:43:50] [INFO ] Computed 5 place invariants in 3 ms
[2021-05-13 19:43:51] [INFO ] Implicit Places using invariants and state equation in 1005 ms returned []
Implicit Place search using SMT with State Equation took 1401 ms to find 0 implicit places.
[2021-05-13 19:43:51] [INFO ] Redundant transitions in 67 ms returned []
[2021-05-13 19:43:51] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2021-05-13 19:43:51] [INFO ] Computed 5 place invariants in 2 ms
[2021-05-13 19:43:52] [INFO ] Dead Transitions using invariants and state equation in 1300 ms returned []
Finished structural reductions, in 1 iterations. Remains : 183/183 places, 2107/2107 transitions.
Incomplete random walk after 100000 steps, including 142 resets, run finished after 486 ms. (steps per millisecond=205 ) properties seen :[0]
[2021-05-13 19:43:53] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2021-05-13 19:43:53] [INFO ] Computed 5 place invariants in 2 ms
[2021-05-13 19:43:53] [INFO ] [Real]Absence check using 5 positive place invariants in 14 ms returned sat
[2021-05-13 19:43:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 19:43:53] [INFO ] [Real]Absence check using state equation in 189 ms returned sat
[2021-05-13 19:43:53] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 19:43:53] [INFO ] [Nat]Absence check using 5 positive place invariants in 20 ms returned sat
[2021-05-13 19:43:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 19:43:54] [INFO ] [Nat]Absence check using state equation in 458 ms returned sat
[2021-05-13 19:43:54] [INFO ] State equation strengthened by 22 read => feed constraints.
[2021-05-13 19:43:54] [INFO ] [Nat]Added 22 Read/Feed constraints in 37 ms returned sat
[2021-05-13 19:43:54] [INFO ] Computed and/alt/rep : 2104/27649/366 causal constraints in 102 ms.
[2021-05-13 19:44:03] [INFO ] Added : 335 causal constraints over 67 iterations in 9448 ms. Result :sat
Ensure Unique test removed 1738 transitions
Reduce isomorphic transitions removed 1738 transitions.
Iterating post reduction 0 with 1738 rules applied. Total rules applied 1738 place count 183 transition count 369
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 1742 place count 181 transition count 367
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 1744 place count 181 transition count 365
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 1746 place count 179 transition count 365
Applied a total of 1746 rules in 37 ms. Remains 179 /183 variables (removed 4) and now considering 365/2107 (removed 1742) transitions.
// Phase 1: matrix 365 rows 179 cols
[2021-05-13 19:44:03] [INFO ] Computed 5 place invariants in 3 ms
[2021-05-13 19:44:03] [INFO ] [Real]Absence check using 5 positive place invariants in 12 ms returned sat
[2021-05-13 19:44:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 19:44:03] [INFO ] [Real]Absence check using state equation in 178 ms returned sat
[2021-05-13 19:44:03] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 19:44:03] [INFO ] [Nat]Absence check using 5 positive place invariants in 15 ms returned sat
[2021-05-13 19:44:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 19:44:04] [INFO ] [Nat]Absence check using state equation in 461 ms returned sat
[2021-05-13 19:44:04] [INFO ] State equation strengthened by 2 read => feed constraints.
[2021-05-13 19:44:04] [INFO ] [Nat]Added 2 Read/Feed constraints in 4 ms returned sat
[2021-05-13 19:44:04] [INFO ] Deduced a trap composed of 12 places in 77 ms
[2021-05-13 19:44:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 116 ms
[2021-05-13 19:44:04] [INFO ] Computed and/alt/rep : 362/3702/362 causal constraints in 44 ms.
[2021-05-13 19:44:11] [INFO ] Added : 349 causal constraints over 71 iterations in 6614 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 117 ms.
[2021-05-13 19:44:11] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 5 ms.
[2021-05-13 19:44:11] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 31 ms.
[2021-05-13 19:44:11] [INFO ] Flatten gal took : 206 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityCardinality @ BridgeAndVehicles-PT-V80P50N10 @ 3570 seconds
vrfy: finished
info: timeLeft: 3567
rslt: Output for ReachabilityCardinality @ BridgeAndVehicles-PT-V80P50N10
{
"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": "Thu May 13 19:44:12 2021
",
"timelimit": 3570
},
"child": null,
"exit":
{
"error": null,
"localtimelimitreached": true,
"memory": 72648,
"runtime": 3.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"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": "E (F ((p83 + 1 <= p84 + p85)))",
"processed_size": 30,
"rewrites": 1,
"skeleton": "E(F(**))"
},
"net":
{
"arcs": 15624,
"conflict_clusters": 2,
"places": 183,
"places_significant": 178,
"singleton_clusters": 0,
"transitions": 2107
},
"task":
{
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 2290/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 5856
lola: finding significant places
lola: 183 places, 2107 transitions, 178 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from ReachabilityCardinality.xml
lola: E (F ((p83 + 1 <= p84 + p85)))
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((p83 + 1 <= p84 + p85)))
lola: processed formula length: 30
lola: 1 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: subprocess will run for 0 seconds at most (--localtimelimit)
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: local time limit reached - aborting
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p83 + 1 <= p84 + p85)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: memory consumption: 72648 KB
lola: time consumption: 3 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="BridgeAndVehicles-PT-V80P50N10"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="gold2020"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# 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 gold2020"
echo " Input is BridgeAndVehicles-PT-V80P50N10, 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 r037-tajo-162038176900151"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-PT-V80P50N10.tgz
mv BridgeAndVehicles-PT-V80P50N10 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 ;