Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r246-smll-162106594400175.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2021-input.qcow2 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 gold2020
Input is ShieldRVt-PT-100B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r246-smll-162106594400175
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.6M
-rw-r--r-- 1 mcc users 15K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 130K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 90K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Mar 28 16:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 28 16:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 28 16:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 28 16:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 27 13:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 27 13:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 25 19:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 25 19:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 08:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:52 equiv_col
-rw-r--r-- 1 mcc users 5 May 5 16:52 instance
-rw-r--r-- 1 mcc users 6 May 5 16:52 iscolored
-rw-r--r-- 1 mcc users 1.3M May 5 16:52 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 ShieldRVt-PT-100B-ReachabilityCardinality-00
FORMULA_NAME ShieldRVt-PT-100B-ReachabilityCardinality-01
FORMULA_NAME ShieldRVt-PT-100B-ReachabilityCardinality-02
FORMULA_NAME ShieldRVt-PT-100B-ReachabilityCardinality-03
FORMULA_NAME ShieldRVt-PT-100B-ReachabilityCardinality-04
FORMULA_NAME ShieldRVt-PT-100B-ReachabilityCardinality-05
FORMULA_NAME ShieldRVt-PT-100B-ReachabilityCardinality-06
FORMULA_NAME ShieldRVt-PT-100B-ReachabilityCardinality-07
FORMULA_NAME ShieldRVt-PT-100B-ReachabilityCardinality-08
FORMULA_NAME ShieldRVt-PT-100B-ReachabilityCardinality-09
FORMULA_NAME ShieldRVt-PT-100B-ReachabilityCardinality-10
FORMULA_NAME ShieldRVt-PT-100B-ReachabilityCardinality-11
FORMULA_NAME ShieldRVt-PT-100B-ReachabilityCardinality-12
FORMULA_NAME ShieldRVt-PT-100B-ReachabilityCardinality-13
FORMULA_NAME ShieldRVt-PT-100B-ReachabilityCardinality-14
FORMULA_NAME ShieldRVt-PT-100B-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1621338349325

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-18 11:45:53] [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-18 11:45:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-18 11:45:54] [INFO ] Load time of PNML (sax parser for PT used): 814 ms
[2021-05-18 11:45:54] [INFO ] Transformed 5003 places.
[2021-05-18 11:45:54] [INFO ] Transformed 5003 transitions.
[2021-05-18 11:45:54] [INFO ] Found NUPN structural information;
[2021-05-18 11:45:54] [INFO ] Parsed PT model containing 5003 places and 5003 transitions in 1191 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 546 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldRVt-PT-100B-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-100B-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-100B-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-100B-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 0 resets, run finished after 164 ms. (steps per millisecond=60 ) properties seen :[1, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 1]
FORMULA ShieldRVt-PT-100B-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-100B-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-100B-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-100B-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-100B-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 30 ms. (steps per millisecond=333 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 22 ms. (steps per millisecond=454 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 21 ms. (steps per millisecond=476 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 31 ms. (steps per millisecond=322 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 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 10001 steps, including 0 resets, run finished after 25 ms. (steps per millisecond=400 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 22 ms. (steps per millisecond=454 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 5003 rows 5003 cols
[2021-05-18 11:45:56] [INFO ] Computed 401 place invariants in 150 ms
[2021-05-18 11:46:00] [INFO ] [Real]Absence check using 401 positive place invariants in 2245 ms returned sat
[2021-05-18 11:46:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 11:46:01] [INFO ] [Real]Absence check using state equation in 977 ms returned (error "Solver has unexpectedly terminated")
[2021-05-18 11:46:04] [INFO ] [Real]Absence check using 401 positive place invariants in 1861 ms returned sat
[2021-05-18 11:46:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 11:46:06] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-18 11:46:06] [INFO ] [Real]Absence check using state equation in 2049 ms returned (error "Failed to check-sat")
[2021-05-18 11:46:09] [INFO ] [Real]Absence check using 401 positive place invariants in 1664 ms returned sat
[2021-05-18 11:46:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 11:46:11] [INFO ] [Real]Absence check using state equation in 2133 ms returned (error "Solver has unexpectedly terminated")
[2021-05-18 11:46:13] [INFO ] [Real]Absence check using 401 positive place invariants in 1719 ms returned sat
[2021-05-18 11:46:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 11:46:16] [INFO ] [Real]Absence check using state equation in 2464 ms returned (error "Solver has unexpectedly terminated")
[2021-05-18 11:46:19] [INFO ] [Real]Absence check using 401 positive place invariants in 1505 ms returned sat
[2021-05-18 11:46:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 11:46:21] [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 (= s218 (- t4495 t4496))") while checking expression at index 4
[2021-05-18 11:46:23] [INFO ] [Real]Absence check using 401 positive place invariants in 1610 ms returned sat
[2021-05-18 11:46:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 11:46:26] [INFO ] [Real]Absence check using state equation in 2557 ms returned (error "Failed to check-sat")
[2021-05-18 11:46:28] [INFO ] [Real]Absence check using 401 positive place invariants in 1781 ms returned sat
[2021-05-18 11:46:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 11:46:31] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-18 11:46:31] [INFO ] [Real]Absence check using state equation in 2427 ms returned (error "Failed to check-sat")
Support contains 33 out of 5003 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5003/5003 places, 5003/5003 transitions.
Performed 1577 Post agglomeration using F-continuation condition.Transition count delta: 1577
Iterating post reduction 0 with 1577 rules applied. Total rules applied 1577 place count 5003 transition count 3426
Reduce places removed 1577 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 1579 rules applied. Total rules applied 3156 place count 3426 transition count 3424
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3157 place count 3425 transition count 3424
Performed 401 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 401 Pre rules applied. Total rules applied 3157 place count 3425 transition count 3023
Deduced a syphon composed of 401 places in 14 ms
Reduce places removed 401 places and 0 transitions.
Iterating global reduction 3 with 802 rules applied. Total rules applied 3959 place count 3024 transition count 3023
Symmetric choice reduction at 3 with 692 rule applications. Total rules 4651 place count 3024 transition count 3023
Deduced a syphon composed of 692 places in 42 ms
Reduce places removed 692 places and 692 transitions.
Iterating global reduction 3 with 1384 rules applied. Total rules applied 6035 place count 2332 transition count 2331
Performed 294 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 294 Pre rules applied. Total rules applied 6035 place count 2332 transition count 2037
Deduced a syphon composed of 294 places in 9 ms
Reduce places removed 294 places and 0 transitions.
Iterating global reduction 3 with 588 rules applied. Total rules applied 6623 place count 2038 transition count 2037
Performed 892 Post agglomeration using F-continuation condition.Transition count delta: 892
Deduced a syphon composed of 892 places in 5 ms
Reduce places removed 892 places and 0 transitions.
Iterating global reduction 3 with 1784 rules applied. Total rules applied 8407 place count 1146 transition count 1145
Renaming transitions due to excessive name length > 1024 char.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -94
Deduced a syphon composed of 101 places in 5 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 8609 place count 1045 transition count 1239
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -96
Deduced a syphon composed of 101 places in 6 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 8811 place count 944 transition count 1335
Performed 87 Post agglomeration using F-continuation condition.Transition count delta: -86
Deduced a syphon composed of 87 places in 2 ms
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 3 with 174 rules applied. Total rules applied 8985 place count 857 transition count 1421
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 8986 place count 857 transition count 1420
Free-agglomeration rule applied 4 times.
Iterating global reduction 4 with 4 rules applied. Total rules applied 8990 place count 857 transition count 1416
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 8994 place count 853 transition count 1416
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 8995 place count 853 transition count 1416
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 8998 place count 853 transition count 1413
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 8999 place count 852 transition count 1412
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 9000 place count 851 transition count 1412
Applied a total of 9000 rules in 2935 ms. Remains 851 /5003 variables (removed 4152) and now considering 1412/5003 (removed 3591) transitions.
Finished structural reductions, in 1 iterations. Remains : 851/5003 places, 1412/5003 transitions.
Incomplete random walk after 1000000 steps, including 112 resets, run finished after 11422 ms. (steps per millisecond=87 ) properties seen :[0, 0, 0, 0, 0, 0, 1]
FORMULA ShieldRVt-PT-100B-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Interrupted Best-First random walk after 587489 steps, including 13 resets, run timeout after 5001 ms. (steps per millisecond=117 ) properties seen :[0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 669051 steps, including 14 resets, run timeout after 5001 ms. (steps per millisecond=133 ) properties seen :[0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 698100 steps, including 12 resets, run timeout after 5001 ms. (steps per millisecond=139 ) properties seen :[0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 636926 steps, including 9 resets, run timeout after 5001 ms. (steps per millisecond=127 ) properties seen :[0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 674964 steps, including 14 resets, run timeout after 5001 ms. (steps per millisecond=134 ) properties seen :[0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 641100 steps, including 12 resets, run timeout after 5001 ms. (steps per millisecond=128 ) properties seen :[0, 0, 0, 0, 0, 0]
// Phase 1: matrix 1412 rows 851 cols
[2021-05-18 11:47:15] [INFO ] Computed 400 place invariants in 4 ms
[2021-05-18 11:47:16] [INFO ] [Real]Absence check using 400 positive place invariants in 273 ms returned sat
[2021-05-18 11:47:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 11:47:19] [INFO ] [Real]Absence check using state equation in 3243 ms returned sat
[2021-05-18 11:47:19] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 11:47:20] [INFO ] [Nat]Absence check using 400 positive place invariants in 289 ms returned sat
[2021-05-18 11:47:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 11:47:23] [INFO ] [Nat]Absence check using state equation in 2707 ms returned sat
[2021-05-18 11:47:23] [INFO ] State equation strengthened by 873 read => feed constraints.
[2021-05-18 11:47:23] [INFO ] [Nat]Added 873 Read/Feed constraints in 129 ms returned sat
[2021-05-18 11:47:23] [INFO ] Computed and/alt/rep : 1408/14034/1408 causal constraints in 175 ms.
[2021-05-18 11:47:43] [INFO ] Added : 500 causal constraints over 100 iterations in 20257 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 152 ms.
[2021-05-18 11:47:45] [INFO ] [Real]Absence check using 400 positive place invariants in 485 ms returned sat
[2021-05-18 11:47:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 11:47:48] [INFO ] [Real]Absence check using state equation in 3524 ms returned sat
[2021-05-18 11:47:48] [INFO ] [Real]Added 873 Read/Feed constraints in 136 ms returned sat
[2021-05-18 11:47:48] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 11:47:49] [INFO ] [Nat]Absence check using 400 positive place invariants in 329 ms returned sat
[2021-05-18 11:47:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 11:47:52] [INFO ] [Nat]Absence check using state equation in 3168 ms returned sat
[2021-05-18 11:47:52] [INFO ] [Nat]Added 873 Read/Feed constraints in 240 ms returned sat
[2021-05-18 11:47:53] [INFO ] Computed and/alt/rep : 1408/14034/1408 causal constraints in 246 ms.
[2021-05-18 11:48:13] [INFO ] Added : 495 causal constraints over 99 iterations in 20118 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 89 ms.
[2021-05-18 11:48:13] [INFO ] [Real]Absence check using 400 positive place invariants in 259 ms returned sat
[2021-05-18 11:48:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 11:48:16] [INFO ] [Real]Absence check using state equation in 2878 ms returned sat
[2021-05-18 11:48:16] [INFO ] [Real]Added 873 Read/Feed constraints in 118 ms returned sat
[2021-05-18 11:48:16] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 11:48:17] [INFO ] [Nat]Absence check using 400 positive place invariants in 261 ms returned sat
[2021-05-18 11:48:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 11:48:20] [INFO ] [Nat]Absence check using state equation in 2850 ms returned sat
[2021-05-18 11:48:20] [INFO ] [Nat]Added 873 Read/Feed constraints in 134 ms returned sat
[2021-05-18 11:48:20] [INFO ] Computed and/alt/rep : 1408/14034/1408 causal constraints in 127 ms.
[2021-05-18 11:48:40] [INFO ] Added : 460 causal constraints over 92 iterations in 20400 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 140 ms.
[2021-05-18 11:48:41] [INFO ] [Real]Absence check using 400 positive place invariants in 459 ms returned sat
[2021-05-18 11:48:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 11:48:44] [INFO ] [Real]Absence check using state equation in 2864 ms returned sat
[2021-05-18 11:48:44] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 11:48:45] [INFO ] [Nat]Absence check using 400 positive place invariants in 350 ms returned sat
[2021-05-18 11:48:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 11:48:48] [INFO ] [Nat]Absence check using state equation in 3018 ms returned sat
[2021-05-18 11:48:48] [INFO ] [Nat]Added 873 Read/Feed constraints in 133 ms returned sat
[2021-05-18 11:48:48] [INFO ] Computed and/alt/rep : 1408/14034/1408 causal constraints in 105 ms.
[2021-05-18 11:49:08] [INFO ] Added : 490 causal constraints over 98 iterations in 20237 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 138 ms.
[2021-05-18 11:49:09] [INFO ] [Real]Absence check using 400 positive place invariants in 446 ms returned sat
[2021-05-18 11:49:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 11:49:12] [INFO ] [Real]Absence check using state equation in 3177 ms returned sat
[2021-05-18 11:49:12] [INFO ] [Real]Added 873 Read/Feed constraints in 131 ms returned sat
[2021-05-18 11:49:13] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 11:49:13] [INFO ] [Nat]Absence check using 400 positive place invariants in 441 ms returned sat
[2021-05-18 11:49:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 11:49:16] [INFO ] [Nat]Absence check using state equation in 2817 ms returned sat
[2021-05-18 11:49:16] [INFO ] [Nat]Added 873 Read/Feed constraints in 138 ms returned sat
[2021-05-18 11:49:16] [INFO ] Computed and/alt/rep : 1408/14034/1408 causal constraints in 95 ms.
[2021-05-18 11:49:37] [INFO ] Added : 550 causal constraints over 110 iterations in 20405 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 131 ms.
[2021-05-18 11:49:38] [INFO ] [Real]Absence check using 400 positive place invariants in 488 ms returned sat
[2021-05-18 11:49:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 11:49:41] [INFO ] [Real]Absence check using state equation in 3304 ms returned sat
[2021-05-18 11:49:41] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 11:49:41] [INFO ] [Nat]Absence check using 400 positive place invariants in 293 ms returned sat
[2021-05-18 11:49:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 11:49:44] [INFO ] [Nat]Absence check using state equation in 2912 ms returned sat
[2021-05-18 11:49:45] [INFO ] [Nat]Added 873 Read/Feed constraints in 161 ms returned sat
[2021-05-18 11:49:45] [INFO ] Computed and/alt/rep : 1408/14034/1408 causal constraints in 149 ms.
[2021-05-18 11:50:05] [INFO ] Added : 560 causal constraints over 112 iterations in 20339 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 114 ms.
Incomplete Parikh walk after 620100 steps, including 1000 resets, run finished after 2297 ms. (steps per millisecond=269 ) properties seen :[0, 0, 1, 0, 0, 0] could not realise parikh vector
FORMULA ShieldRVt-PT-100B-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 1141700 steps, including 1000 resets, run finished after 3251 ms. (steps per millisecond=351 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 877700 steps, including 1000 resets, run finished after 2526 ms. (steps per millisecond=347 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 742200 steps, including 1000 resets, run finished after 2863 ms. (steps per millisecond=259 ) properties seen :[1, 0, 0, 1, 0] could not realise parikh vector
FORMULA ShieldRVt-PT-100B-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldRVt-PT-100B-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 944100 steps, including 1000 resets, run finished after 2928 ms. (steps per millisecond=322 ) properties seen :[1, 0, 0] could not realise parikh vector
FORMULA ShieldRVt-PT-100B-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 958200 steps, including 1000 resets, run finished after 2747 ms. (steps per millisecond=348 ) properties seen :[0, 0] could not realise parikh vector
Support contains 19 out of 851 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 851/851 places, 1412/1412 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 851 transition count 1405
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 844 transition count 1405
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 14 place count 844 transition count 1402
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 20 place count 841 transition count 1402
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 36 place count 833 transition count 1394
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 40 place count 831 transition count 1398
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 41 place count 831 transition count 1397
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 42 place count 830 transition count 1397
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 43 place count 830 transition count 1397
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 44 place count 830 transition count 1396
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 45 place count 829 transition count 1395
Applied a total of 45 rules in 354 ms. Remains 829 /851 variables (removed 22) and now considering 1395/1412 (removed 17) transitions.
Finished structural reductions, in 1 iterations. Remains : 829/851 places, 1395/1412 transitions.
Incomplete random walk after 1000000 steps, including 133 resets, run finished after 9268 ms. (steps per millisecond=107 ) properties seen :[0, 0]
Interrupted Best-First random walk after 687365 steps, including 8 resets, run timeout after 5001 ms. (steps per millisecond=137 ) properties seen :[0, 0]
Interrupted Best-First random walk after 662745 steps, including 10 resets, run timeout after 5001 ms. (steps per millisecond=132 ) properties seen :[0, 0]
Interrupted probabilistic random walk after 1648565 steps, run timeout after 30001 ms. (steps per millisecond=54 ) properties seen :[0, 0]
Probabilistic random walk after 1648565 steps, saw 204144 distinct states, run finished after 30001 ms. (steps per millisecond=54 ) properties seen :[0, 0]
// Phase 1: matrix 1395 rows 829 cols
[2021-05-18 11:51:11] [INFO ] Computed 400 place invariants in 4 ms
[2021-05-18 11:51:12] [INFO ] [Real]Absence check using 400 positive place invariants in 290 ms returned sat
[2021-05-18 11:51:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 11:51:15] [INFO ] [Real]Absence check using state equation in 2862 ms returned sat
[2021-05-18 11:51:15] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 11:51:15] [INFO ] [Nat]Absence check using 400 positive place invariants in 380 ms returned sat
[2021-05-18 11:51:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 11:51:18] [INFO ] [Nat]Absence check using state equation in 2679 ms returned sat
[2021-05-18 11:51:18] [INFO ] State equation strengthened by 40 read => feed constraints.
[2021-05-18 11:51:18] [INFO ] [Nat]Added 40 Read/Feed constraints in 20 ms returned sat
[2021-05-18 11:51:18] [INFO ] Computed and/alt/rep : 1386/4590/1386 causal constraints in 86 ms.
[2021-05-18 11:51:38] [INFO ] Added : 820 causal constraints over 164 iterations in 20304 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 63 ms.
[2021-05-18 11:51:39] [INFO ] [Real]Absence check using 400 positive place invariants in 305 ms returned sat
[2021-05-18 11:51:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 11:51:42] [INFO ] [Real]Absence check using state equation in 2850 ms returned sat
[2021-05-18 11:51:42] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 11:51:43] [INFO ] [Nat]Absence check using 400 positive place invariants in 394 ms returned sat
[2021-05-18 11:51:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 11:51:45] [INFO ] [Nat]Absence check using state equation in 2758 ms returned sat
[2021-05-18 11:51:45] [INFO ] [Nat]Added 40 Read/Feed constraints in 33 ms returned sat
[2021-05-18 11:51:45] [INFO ] Computed and/alt/rep : 1386/4590/1386 causal constraints in 88 ms.
[2021-05-18 11:52:06] [INFO ] Added : 835 causal constraints over 167 iterations in 20158 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 56 ms.
Incomplete Parikh walk after 174300 steps, including 1000 resets, run finished after 1919 ms. (steps per millisecond=90 ) properties seen :[1, 0] could not realise parikh vector
FORMULA ShieldRVt-PT-100B-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 184500 steps, including 1000 resets, run finished after 1922 ms. (steps per millisecond=95 ) properties seen :[0] could not realise parikh vector
Support contains 11 out of 829 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 829/829 places, 1395/1395 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 829 transition count 1391
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 825 transition count 1391
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 8 place count 825 transition count 1387
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 16 place count 821 transition count 1387
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 20 place count 819 transition count 1391
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 21 place count 818 transition count 1390
Applied a total of 21 rules in 95 ms. Remains 818 /829 variables (removed 11) and now considering 1390/1395 (removed 5) transitions.
Finished structural reductions, in 1 iterations. Remains : 818/829 places, 1390/1395 transitions.
Incomplete random walk after 1000000 steps, including 280 resets, run finished after 9837 ms. (steps per millisecond=101 ) properties seen :[0]
Interrupted Best-First random walk after 623217 steps, including 14 resets, run timeout after 5001 ms. (steps per millisecond=124 ) properties seen :[0]
Interrupted probabilistic random walk after 1490493 steps, run timeout after 30001 ms. (steps per millisecond=49 ) properties seen :[0]
Probabilistic random walk after 1490493 steps, saw 224671 distinct states, run finished after 30001 ms. (steps per millisecond=49 ) properties seen :[0]
// Phase 1: matrix 1390 rows 818 cols
[2021-05-18 11:52:55] [INFO ] Computed 400 place invariants in 4 ms
[2021-05-18 11:52:55] [INFO ] [Real]Absence check using 400 positive place invariants in 319 ms returned sat
[2021-05-18 11:52:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 11:52:58] [INFO ] [Real]Absence check using state equation in 2816 ms returned sat
[2021-05-18 11:52:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 11:52:58] [INFO ] [Nat]Absence check using 400 positive place invariants in 284 ms returned sat
[2021-05-18 11:52:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 11:53:01] [INFO ] [Nat]Absence check using state equation in 2685 ms returned sat
[2021-05-18 11:53:01] [INFO ] State equation strengthened by 36 read => feed constraints.
[2021-05-18 11:53:01] [INFO ] [Nat]Added 36 Read/Feed constraints in 20 ms returned sat
[2021-05-18 11:53:01] [INFO ] Computed and/alt/rep : 1383/4594/1383 causal constraints in 84 ms.
[2021-05-18 11:53:21] [INFO ] Added : 710 causal constraints over 142 iterations in 20072 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 65 ms.
Incomplete Parikh walk after 197800 steps, including 1001 resets, run finished after 2275 ms. (steps per millisecond=86 ) properties seen :[0] could not realise parikh vector
Support contains 11 out of 818 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 818/818 places, 1390/1390 transitions.
Applied a total of 0 rules in 46 ms. Remains 818 /818 variables (removed 0) and now considering 1390/1390 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 818/818 places, 1390/1390 transitions.
Starting structural reductions, iteration 0 : 818/818 places, 1390/1390 transitions.
Applied a total of 0 rules in 60 ms. Remains 818 /818 variables (removed 0) and now considering 1390/1390 (removed 0) transitions.
// Phase 1: matrix 1390 rows 818 cols
[2021-05-18 11:53:24] [INFO ] Computed 400 place invariants in 20 ms
[2021-05-18 11:53:27] [INFO ] Implicit Places using invariants in 3151 ms returned []
// Phase 1: matrix 1390 rows 818 cols
[2021-05-18 11:53:27] [INFO ] Computed 400 place invariants in 4 ms
[2021-05-18 11:53:31] [INFO ] State equation strengthened by 36 read => feed constraints.
[2021-05-18 11:53:43] [INFO ] Implicit Places using invariants and state equation in 16186 ms returned []
Implicit Place search using SMT with State Equation took 19341 ms to find 0 implicit places.
[2021-05-18 11:53:43] [INFO ] Redundant transitions in 176 ms returned []
// Phase 1: matrix 1390 rows 818 cols
[2021-05-18 11:53:43] [INFO ] Computed 400 place invariants in 5 ms
[2021-05-18 11:53:48] [INFO ] Dead Transitions using invariants and state equation in 4954 ms returned []
Finished structural reductions, in 1 iterations. Remains : 818/818 places, 1390/1390 transitions.
Incomplete random walk after 100000 steps, including 29 resets, run finished after 1176 ms. (steps per millisecond=85 ) properties seen :[0]
// Phase 1: matrix 1390 rows 818 cols
[2021-05-18 11:53:49] [INFO ] Computed 400 place invariants in 3 ms
[2021-05-18 11:53:50] [INFO ] [Real]Absence check using 400 positive place invariants in 453 ms returned sat
[2021-05-18 11:53:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 11:53:53] [INFO ] [Real]Absence check using state equation in 2856 ms returned sat
[2021-05-18 11:53:53] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 11:53:54] [INFO ] [Nat]Absence check using 400 positive place invariants in 390 ms returned sat
[2021-05-18 11:53:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 11:53:56] [INFO ] [Nat]Absence check using state equation in 2819 ms returned sat
[2021-05-18 11:53:56] [INFO ] State equation strengthened by 36 read => feed constraints.
[2021-05-18 11:53:56] [INFO ] [Nat]Added 36 Read/Feed constraints in 19 ms returned sat
[2021-05-18 11:53:57] [INFO ] Computed and/alt/rep : 1383/4594/1383 causal constraints in 73 ms.
[2021-05-18 11:54:13] [INFO ] Added : 555 causal constraints over 111 iterations in 16548 ms. Result :unknown
Graph (trivial) has 384 edges and 818 vertex of which 4 / 818 are part of one of the 2 SCC in 12 ms
Free SCC test removed 2 places
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Graph (complete) has 2813 edges and 816 vertex of which 814 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.28 ms
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (trivial) has 381 edges and 812 vertex of which 4 / 812 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 11 rules applied. Total rules applied 13 place count 810 transition count 1381
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 380 edges and 808 vertex of which 6 / 808 are part of one of the 3 SCC in 5 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 805 transition count 1372
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 378 edges and 802 vertex of which 8 / 802 are part of one of the 4 SCC in 2 ms
Free SCC test removed 4 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 40 place count 798 transition count 1361
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 374 edges and 794 vertex of which 8 / 794 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 3 with 19 rules applied. Total rules applied 59 place count 790 transition count 1347
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 370 edges and 786 vertex of which 8 / 786 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 4 with 19 rules applied. Total rules applied 78 place count 782 transition count 1333
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 366 edges and 778 vertex of which 8 / 778 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 5 with 19 rules applied. Total rules applied 97 place count 774 transition count 1319
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 362 edges and 770 vertex of which 8 / 770 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 6 with 19 rules applied. Total rules applied 116 place count 766 transition count 1305
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 358 edges and 762 vertex of which 8 / 762 are part of one of the 4 SCC in 2 ms
Free SCC test removed 4 places
Iterating post reduction 7 with 19 rules applied. Total rules applied 135 place count 758 transition count 1291
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 354 edges and 754 vertex of which 8 / 754 are part of one of the 4 SCC in 2 ms
Free SCC test removed 4 places
Iterating post reduction 8 with 19 rules applied. Total rules applied 154 place count 750 transition count 1277
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 347 edges and 748 vertex of which 2 / 748 are part of one of the 1 SCC in 2 ms
Free SCC test removed 1 places
Iterating post reduction 9 with 13 rules applied. Total rules applied 167 place count 747 transition count 1267
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 171 place count 746 transition count 1264
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 173 place count 745 transition count 1263
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Graph (complete) has 2563 edges and 745 vertex of which 743 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Iterating post reduction 11 with 1 rules applied. Total rules applied 174 place count 743 transition count 1262
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 12 with 4 rules applied. Total rules applied 178 place count 743 transition count 1258
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 13 with 2 rules applied. Total rules applied 180 place count 743 transition count 1258
Partial Post-agglomeration rule applied 87 times.
Drop transitions removed 87 transitions
Iterating global reduction 13 with 87 rules applied. Total rules applied 267 place count 743 transition count 1258
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 269 place count 743 transition count 1256
Drop transitions removed 89 transitions
Redundant transition composition rules discarded 89 transitions
Iterating global reduction 14 with 89 rules applied. Total rules applied 358 place count 743 transition count 1167
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 360 place count 741 transition count 1167
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 15 with 3 rules applied. Total rules applied 363 place count 739 transition count 1166
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 15 with 3 rules applied. Total rules applied 366 place count 739 transition count 1163
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 16 with 1 rules applied. Total rules applied 367 place count 739 transition count 1163
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 16 with 1 rules applied. Total rules applied 368 place count 739 transition count 1162
Applied a total of 368 rules in 558 ms. Remains 739 /818 variables (removed 79) and now considering 1162/1390 (removed 228) transitions.
// Phase 1: matrix 1162 rows 739 cols
[2021-05-18 11:54:14] [INFO ] Computed 361 place invariants in 4 ms
[2021-05-18 11:54:14] [INFO ] [Real]Absence check using 361 positive place invariants in 249 ms returned sat
[2021-05-18 11:54:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 11:54:16] [INFO ] [Real]Absence check using state equation in 2172 ms returned sat
[2021-05-18 11:54:16] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 11:54:17] [INFO ] [Nat]Absence check using 361 positive place invariants in 228 ms returned sat
[2021-05-18 11:54:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 11:54:19] [INFO ] [Nat]Absence check using state equation in 2386 ms returned sat
[2021-05-18 11:54:19] [INFO ] State equation strengthened by 3 read => feed constraints.
[2021-05-18 11:54:19] [INFO ] [Nat]Added 3 Read/Feed constraints in 16 ms returned sat
[2021-05-18 11:54:19] [INFO ] Computed and/alt/rep : 1158/3826/1158 causal constraints in 78 ms.
[2021-05-18 11:54:39] [INFO ] Added : 825 causal constraints over 165 iterations in 20105 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 56 ms.
[2021-05-18 11:54:39] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 5 ms.
[2021-05-18 11:54:40] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 61 ms.
[2021-05-18 11:54:40] [INFO ] Flatten gal took : 294 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityCardinality @ ShieldRVt-PT-100B @ 3570 seconds
vrfy: finished
info: timeLeft: 3553
rslt: Output for ReachabilityCardinality @ ShieldRVt-PT-100B

{
"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",
"--safe",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--json=ReachabilityCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Tue May 18 11:54:41 2021
",
"timelimit": 3570
},
"child": null,
"exit":
{
"error": null,
"localtimelimitreached": true,
"memory": 33792,
"runtime": 17.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": 9,
"adisj": 7,
"aneg": 0,
"comp": 12,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 11,
"visible_transitions": 0
},
"processed": "E (F (((p360 <= 1) AND (1 <= p360) AND (((p417 <= 0)) OR ((1 <= p18))) AND ((((1 <= p713)) AND ((p538 <= 0))) OR (((1 <= p739)) AND ((p585 <= 0)))) AND (((p557 <= 0)) OR ((1 <= p555)) OR ((p165 <= 0)) OR ((1 <= p167))))))",
"processed_size": 226,
"rewrites": 1,
"skeleton": "E(F(**))"
},
"net":
{
"arcs": 7831,
"conflict_clusters": 217,
"places": 818,
"places_significant": 418,
"singleton_clusters": 0,
"transitions": 1390
},
"task":
{
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 96,
"problems": 16
},
"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: 2208/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 818
lola: finding significant places
lola: 818 places, 1390 transitions, 418 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: LP says that atomic proposition is always true: (p18 <= 1)
lola: LP says that atomic proposition is always true: (p538 <= 1)
lola: LP says that atomic proposition is always true: (p585 <= 1)
lola: LP says that atomic proposition is always true: (p555 <= 1)
lola: LP says that atomic proposition is always true: (p167 <= 1)
lola: E (F (((p360 <= 1) AND (1 <= p360) AND (((p417 <= 0)) OR ((1 <= p18))) AND ((((1 <= p713)) AND ((p538 <= 0))) OR (((1 <= p739)) AND ((p585 <= 0)))) AND (((p557 <= 0)) OR ((1 <= p555)) OR ((p165 <= 0)) OR ((1 <= p167))))))
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 (((p360 <= 1) AND (1 <= p360) AND (((p417 <= 0)) OR ((1 <= p18))) AND ((((1 <= p713)) AND ((p538 <= 0))) OR (((1 <= p739)) AND ((p585 <= 0)))) AND (((p557 <= 0)) OR ((1 <= p555)) OR ((p165 <= 0)) OR ((1 <= p167))))))
lola: processed formula length: 226
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: local time limit reached - aborting
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: state equation task get result unparse finished++ id 0
lola: formula 0: ((p360 <= 1) AND (1 <= p360) AND (((p417 <= 0)) OR ((1 <= p18))) AND ((((1 <= p713)) AND ((p538 <= 0))) OR (((1 <= p739)) AND ((p585 <= 0)))) AND (((p557 <= 0)) OR ((1 <= p555)) OR ((p165 <= 0)) OR ((1 <= p167))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 96 literals and 16 conjunctive subformulas
lola: memory consumption: 33792 KB
lola: time consumption: 17 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="ShieldRVt-PT-100B"
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 ShieldRVt-PT-100B, 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 r246-smll-162106594400175"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVt-PT-100B.tgz
mv ShieldRVt-PT-100B 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 ;