fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r246-smll-162106594300087
Last Updated
Jun 28, 2021

About the Execution of 2020-gold for ShieldRVs-PT-100B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
9161.067 3600000.00 326874.00 1053.00 FTFFFFT?TFFFFTFF normal

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-162106594300087.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 ShieldRVs-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-162106594300087
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 18K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 170K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 110K 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.5K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Mar 28 16:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 16:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 16:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 16:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 27 12:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 27 12:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 25 18:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 25 18:58 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 ShieldRVs-PT-100B-ReachabilityCardinality-00
FORMULA_NAME ShieldRVs-PT-100B-ReachabilityCardinality-01
FORMULA_NAME ShieldRVs-PT-100B-ReachabilityCardinality-02
FORMULA_NAME ShieldRVs-PT-100B-ReachabilityCardinality-03
FORMULA_NAME ShieldRVs-PT-100B-ReachabilityCardinality-04
FORMULA_NAME ShieldRVs-PT-100B-ReachabilityCardinality-05
FORMULA_NAME ShieldRVs-PT-100B-ReachabilityCardinality-06
FORMULA_NAME ShieldRVs-PT-100B-ReachabilityCardinality-07
FORMULA_NAME ShieldRVs-PT-100B-ReachabilityCardinality-08
FORMULA_NAME ShieldRVs-PT-100B-ReachabilityCardinality-09
FORMULA_NAME ShieldRVs-PT-100B-ReachabilityCardinality-10
FORMULA_NAME ShieldRVs-PT-100B-ReachabilityCardinality-11
FORMULA_NAME ShieldRVs-PT-100B-ReachabilityCardinality-12
FORMULA_NAME ShieldRVs-PT-100B-ReachabilityCardinality-13
FORMULA_NAME ShieldRVs-PT-100B-ReachabilityCardinality-14
FORMULA_NAME ShieldRVs-PT-100B-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1621313728268

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-18 04:55:30] [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 04:55:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-18 04:55:31] [INFO ] Load time of PNML (sax parser for PT used): 407 ms
[2021-05-18 04:55:31] [INFO ] Transformed 4003 places.
[2021-05-18 04:55:31] [INFO ] Transformed 4503 transitions.
[2021-05-18 04:55:31] [INFO ] Found NUPN structural information;
[2021-05-18 04:55:31] [INFO ] Parsed PT model containing 4003 places and 4503 transitions in 628 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 201 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldRVs-PT-100B-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-100B-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-100B-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-100B-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-100B-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-100B-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 225 ms. (steps per millisecond=44 ) properties seen :[1, 1, 1, 0, 1, 1, 0, 1, 0, 1]
FORMULA ShieldRVs-PT-100B-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-100B-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-100B-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-100B-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-100B-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-100B-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-100B-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 29 ms. (steps per millisecond=344 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 50 ms. (steps per millisecond=200 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 29 ms. (steps per millisecond=344 ) properties seen :[0, 0, 0]
// Phase 1: matrix 4503 rows 4003 cols
[2021-05-18 04:55:32] [INFO ] Computed 401 place invariants in 133 ms
[2021-05-18 04:55:34] [INFO ] [Real]Absence check using 401 positive place invariants in 1171 ms returned sat
[2021-05-18 04:55:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 04:55:37] [INFO ] [Real]Absence check using state equation in 2844 ms returned (error "Solver has unexpectedly terminated")
[2021-05-18 04:55:39] [INFO ] [Real]Absence check using 401 positive place invariants in 1309 ms returned sat
[2021-05-18 04:55:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 04:55:42] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-18 04:55:42] [INFO ] [Real]Absence check using state equation in 3011 ms returned (error "Failed to check-sat")
[2021-05-18 04:55:44] [INFO ] [Real]Absence check using 401 positive place invariants in 1258 ms returned sat
[2021-05-18 04:55:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 04:55:47] [INFO ] [Real]Absence check using state equation in 3037 ms returned (error "Solver has unexpectedly terminated")
Support contains 19 out of 4003 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 4003/4003 places, 4503/4503 transitions.
Performed 395 Post agglomeration using F-continuation condition.Transition count delta: 395
Iterating post reduction 0 with 395 rules applied. Total rules applied 395 place count 4003 transition count 4108
Reduce places removed 395 places and 0 transitions.
Iterating post reduction 1 with 395 rules applied. Total rules applied 790 place count 3608 transition count 4108
Performed 500 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 500 Pre rules applied. Total rules applied 790 place count 3608 transition count 3608
Deduced a syphon composed of 500 places in 20 ms
Reduce places removed 500 places and 0 transitions.
Iterating global reduction 2 with 1000 rules applied. Total rules applied 1790 place count 3108 transition count 3608
Symmetric choice reduction at 2 with 691 rule applications. Total rules 2481 place count 3108 transition count 3608
Deduced a syphon composed of 691 places in 17 ms
Reduce places removed 691 places and 691 transitions.
Iterating global reduction 2 with 1382 rules applied. Total rules applied 3863 place count 2417 transition count 2917
Performed 291 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 291 Pre rules applied. Total rules applied 3863 place count 2417 transition count 2626
Deduced a syphon composed of 291 places in 30 ms
Reduce places removed 291 places and 0 transitions.
Iterating global reduction 2 with 582 rules applied. Total rules applied 4445 place count 2126 transition count 2626
Performed 703 Post agglomeration using F-continuation condition.Transition count delta: 703
Deduced a syphon composed of 703 places in 11 ms
Reduce places removed 703 places and 0 transitions.
Iterating global reduction 2 with 1406 rules applied. Total rules applied 5851 place count 1423 transition count 1923
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 202 times.
Drop transitions removed 202 transitions
Iterating global reduction 2 with 202 rules applied. Total rules applied 6053 place count 1423 transition count 1923
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 6054 place count 1422 transition count 1922
Applied a total of 6054 rules in 1891 ms. Remains 1422 /4003 variables (removed 2581) and now considering 1922/4503 (removed 2581) transitions.
Finished structural reductions, in 1 iterations. Remains : 1422/4003 places, 1922/4503 transitions.
Incomplete random walk after 1000000 steps, including 860 resets, run finished after 10306 ms. (steps per millisecond=97 ) properties seen :[0, 1, 0]
FORMULA ShieldRVs-PT-100B-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Interrupted Best-First random walk after 688969 steps, including 63 resets, run timeout after 5001 ms. (steps per millisecond=137 ) properties seen :[0, 0]
Interrupted Best-First random walk after 696072 steps, including 58 resets, run timeout after 5001 ms. (steps per millisecond=139 ) properties seen :[0, 1]
FORMULA ShieldRVs-PT-100B-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 1922 rows 1422 cols
[2021-05-18 04:56:09] [INFO ] Computed 401 place invariants in 19 ms
[2021-05-18 04:56:10] [INFO ] [Real]Absence check using 401 positive place invariants in 392 ms returned sat
[2021-05-18 04:56:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 04:56:16] [INFO ] [Real]Absence check using state equation in 5993 ms returned sat
[2021-05-18 04:56:16] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 04:56:16] [INFO ] [Nat]Absence check using 401 positive place invariants in 388 ms returned sat
[2021-05-18 04:56:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 04:56:23] [INFO ] [Nat]Absence check using state equation in 6273 ms returned sat
[2021-05-18 04:56:23] [INFO ] Deduced a trap composed of 11 places in 314 ms
[2021-05-18 04:56:23] [INFO ] Deduced a trap composed of 15 places in 190 ms
[2021-05-18 04:56:24] [INFO ] Deduced a trap composed of 8 places in 154 ms
[2021-05-18 04:56:24] [INFO ] Deduced a trap composed of 21 places in 117 ms
[2021-05-18 04:56:24] [INFO ] Deduced a trap composed of 25 places in 120 ms
[2021-05-18 04:56:24] [INFO ] Deduced a trap composed of 13 places in 107 ms
[2021-05-18 04:56:24] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1538 ms
[2021-05-18 04:56:24] [INFO ] Computed and/alt/rep : 1915/13054/1915 causal constraints in 188 ms.
[2021-05-18 04:56:44] [INFO ] Added : 655 causal constraints over 131 iterations in 20279 ms.(timeout) Result :sat
[2021-05-18 04:56:45] [INFO ] Deduced a trap composed of 6 places in 68 ms
[2021-05-18 04:56:45] [INFO ] Deduced a trap composed of 5 places in 39 ms
[2021-05-18 04:56:45] [INFO ] Deduced a trap composed of 12 places in 21 ms
[2021-05-18 04:56:45] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 883 ms
Attempting to minimize the solution found.
Minimization took 141 ms.
Incomplete Parikh walk after 286900 steps, including 643 resets, run finished after 3454 ms. (steps per millisecond=83 ) properties seen :[0] could not realise parikh vector
Support contains 4 out of 1422 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1422/1422 places, 1922/1922 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 1422 transition count 1920
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 1420 transition count 1920
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 1420 transition count 1918
Deduced a syphon composed of 2 places in 10 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 1418 transition count 1918
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 10 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 26 place count 1409 transition count 1909
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 28 place count 1409 transition count 1909
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 29 place count 1408 transition count 1908
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 1407 transition count 1907
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 31 place count 1406 transition count 1906
Applied a total of 31 rules in 1026 ms. Remains 1406 /1422 variables (removed 16) and now considering 1906/1922 (removed 16) transitions.
Finished structural reductions, in 1 iterations. Remains : 1406/1422 places, 1906/1922 transitions.
Incomplete random walk after 1000000 steps, including 877 resets, run finished after 10586 ms. (steps per millisecond=94 ) properties seen :[0]
Interrupted Best-First random walk after 677935 steps, including 63 resets, run timeout after 5001 ms. (steps per millisecond=135 ) properties seen :[0]
Interrupted probabilistic random walk after 2349383 steps, run timeout after 30001 ms. (steps per millisecond=78 ) properties seen :[0]
Probabilistic random walk after 2349383 steps, saw 15158 distinct states, run finished after 30001 ms. (steps per millisecond=78 ) properties seen :[0]
// Phase 1: matrix 1906 rows 1406 cols
[2021-05-18 04:57:36] [INFO ] Computed 401 place invariants in 34 ms
[2021-05-18 04:57:37] [INFO ] [Real]Absence check using 401 positive place invariants in 513 ms returned sat
[2021-05-18 04:57:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 04:57:42] [INFO ] [Real]Absence check using state equation in 5865 ms returned sat
[2021-05-18 04:57:42] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 04:57:43] [INFO ] [Nat]Absence check using 401 positive place invariants in 361 ms returned sat
[2021-05-18 04:57:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 04:57:49] [INFO ] [Nat]Absence check using state equation in 5720 ms returned sat
[2021-05-18 04:57:49] [INFO ] Deduced a trap composed of 15 places in 224 ms
[2021-05-18 04:57:50] [INFO ] Deduced a trap composed of 5 places in 310 ms
[2021-05-18 04:57:50] [INFO ] Deduced a trap composed of 14 places in 237 ms
[2021-05-18 04:57:50] [INFO ] Deduced a trap composed of 6 places in 199 ms
[2021-05-18 04:57:50] [INFO ] Deduced a trap composed of 15 places in 177 ms
[2021-05-18 04:57:51] [INFO ] Deduced a trap composed of 22 places in 174 ms
[2021-05-18 04:57:51] [INFO ] Deduced a trap composed of 16 places in 172 ms
[2021-05-18 04:57:51] [INFO ] Deduced a trap composed of 20 places in 168 ms
[2021-05-18 04:57:51] [INFO ] Deduced a trap composed of 38 places in 173 ms
[2021-05-18 04:57:51] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2504 ms
[2021-05-18 04:57:52] [INFO ] Computed and/alt/rep : 1903/10009/1903 causal constraints in 128 ms.
[2021-05-18 04:58:12] [INFO ] Added : 705 causal constraints over 141 iterations in 20376 ms.(timeout) Result :sat
[2021-05-18 04:58:12] [INFO ] Deduced a trap composed of 6 places in 25 ms
[2021-05-18 04:58:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 368 ms
Attempting to minimize the solution found.
Minimization took 144 ms.
Incomplete Parikh walk after 260300 steps, including 469 resets, run finished after 3079 ms. (steps per millisecond=84 ) properties seen :[0] could not realise parikh vector
Support contains 4 out of 1406 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1406/1406 places, 1906/1906 transitions.
Applied a total of 0 rules in 65 ms. Remains 1406 /1406 variables (removed 0) and now considering 1906/1906 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1406/1406 places, 1906/1906 transitions.
Starting structural reductions, iteration 0 : 1406/1406 places, 1906/1906 transitions.
Applied a total of 0 rules in 67 ms. Remains 1406 /1406 variables (removed 0) and now considering 1906/1906 (removed 0) transitions.
// Phase 1: matrix 1906 rows 1406 cols
[2021-05-18 04:58:16] [INFO ] Computed 401 place invariants in 12 ms
[2021-05-18 04:58:20] [INFO ] Implicit Places using invariants in 4391 ms returned []
// Phase 1: matrix 1906 rows 1406 cols
[2021-05-18 04:58:20] [INFO ] Computed 401 place invariants in 10 ms
[2021-05-18 04:58:45] [INFO ] Implicit Places using invariants and state equation in 24945 ms returned []
Implicit Place search using SMT with State Equation took 29340 ms to find 0 implicit places.
[2021-05-18 04:58:46] [INFO ] Redundant transitions in 1387 ms returned []
// Phase 1: matrix 1906 rows 1406 cols
[2021-05-18 04:58:46] [INFO ] Computed 401 place invariants in 8 ms
[2021-05-18 04:58:53] [INFO ] Dead Transitions using invariants and state equation in 6842 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1406/1406 places, 1906/1906 transitions.
Incomplete random walk after 100000 steps, including 87 resets, run finished after 1027 ms. (steps per millisecond=97 ) properties seen :[0]
// Phase 1: matrix 1906 rows 1406 cols
[2021-05-18 04:58:54] [INFO ] Computed 401 place invariants in 8 ms
[2021-05-18 04:58:55] [INFO ] [Real]Absence check using 401 positive place invariants in 394 ms returned sat
[2021-05-18 04:58:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 04:59:01] [INFO ] [Real]Absence check using state equation in 6043 ms returned sat
[2021-05-18 04:59:01] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 04:59:02] [INFO ] [Nat]Absence check using 401 positive place invariants in 368 ms returned sat
[2021-05-18 04:59:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 04:59:07] [INFO ] [Nat]Absence check using state equation in 5908 ms returned sat
[2021-05-18 04:59:08] [INFO ] Deduced a trap composed of 15 places in 229 ms
[2021-05-18 04:59:08] [INFO ] Deduced a trap composed of 5 places in 255 ms
[2021-05-18 04:59:08] [INFO ] Deduced a trap composed of 14 places in 247 ms
[2021-05-18 04:59:09] [INFO ] Deduced a trap composed of 6 places in 204 ms
[2021-05-18 04:59:09] [INFO ] Deduced a trap composed of 15 places in 184 ms
[2021-05-18 04:59:09] [INFO ] Deduced a trap composed of 22 places in 157 ms
[2021-05-18 04:59:09] [INFO ] Deduced a trap composed of 16 places in 181 ms
[2021-05-18 04:59:10] [INFO ] Deduced a trap composed of 20 places in 172 ms
[2021-05-18 04:59:10] [INFO ] Deduced a trap composed of 38 places in 172 ms
[2021-05-18 04:59:10] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2500 ms
[2021-05-18 04:59:10] [INFO ] Computed and/alt/rep : 1903/10009/1903 causal constraints in 125 ms.
[2021-05-18 04:59:21] [INFO ] Added : 460 causal constraints over 92 iterations in 10990 ms. Result :(error "Solver has unexpectedly terminated")
Applied a total of 0 rules in 80 ms. Remains 1406 /1406 variables (removed 0) and now considering 1906/1906 (removed 0) transitions.
// Phase 1: matrix 1906 rows 1406 cols
[2021-05-18 04:59:21] [INFO ] Computed 401 place invariants in 9 ms
[2021-05-18 04:59:22] [INFO ] [Real]Absence check using 401 positive place invariants in 386 ms returned sat
[2021-05-18 04:59:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 04:59:28] [INFO ] [Real]Absence check using state equation in 6119 ms returned sat
[2021-05-18 04:59:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 04:59:28] [INFO ] [Nat]Absence check using 401 positive place invariants in 367 ms returned sat
[2021-05-18 04:59:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 04:59:34] [INFO ] [Nat]Absence check using state equation in 5965 ms returned sat
[2021-05-18 04:59:35] [INFO ] Deduced a trap composed of 15 places in 224 ms
[2021-05-18 04:59:35] [INFO ] Deduced a trap composed of 5 places in 251 ms
[2021-05-18 04:59:35] [INFO ] Deduced a trap composed of 14 places in 238 ms
[2021-05-18 04:59:36] [INFO ] Deduced a trap composed of 6 places in 194 ms
[2021-05-18 04:59:36] [INFO ] Deduced a trap composed of 15 places in 178 ms
[2021-05-18 04:59:36] [INFO ] Deduced a trap composed of 22 places in 174 ms
[2021-05-18 04:59:36] [INFO ] Deduced a trap composed of 16 places in 173 ms
[2021-05-18 04:59:37] [INFO ] Deduced a trap composed of 20 places in 167 ms
[2021-05-18 04:59:37] [INFO ] Deduced a trap composed of 38 places in 169 ms
[2021-05-18 04:59:37] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2470 ms
[2021-05-18 04:59:37] [INFO ] Computed and/alt/rep : 1903/10009/1903 causal constraints in 131 ms.
[2021-05-18 04:59:57] [INFO ] Added : 695 causal constraints over 139 iterations in 20245 ms.(timeout) Result :sat
[2021-05-18 04:59:57] [INFO ] Deduced a trap composed of 6 places in 29 ms
[2021-05-18 04:59:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 364 ms
Attempting to minimize the solution found.
Minimization took 145 ms.
[2021-05-18 04:59:58] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 3 ms.
[2021-05-18 04:59:58] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 28 ms.
[2021-05-18 04:59:58] [INFO ] Flatten gal took : 341 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityCardinality @ ShieldRVs-PT-100B @ 3570 seconds
vrfy: finished
info: timeLeft: 3564
rslt: Output for ReachabilityCardinality @ ShieldRVs-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 05:00:00 2021
",
"timelimit": 3570
},
"child": null,
"exit":
{
"error": null,
"localtimelimitreached": true,
"memory": 39920,
"runtime": 6.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": 1,
"adisj": 4,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "E (F ((((1 <= p194)) AND ((p1008 <= 0)) AND ((1 <= p760)) AND ((p1144 <= 0)))))",
"processed_size": 79,
"rewrites": 1,
"skeleton": "E(F(**))"
},
"net":
{
"arcs": 9210,
"conflict_clusters": 105,
"places": 1406,
"places_significant": 1005,
"singleton_clusters": 0,
"transitions": 1906
},
"task":
{
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 4
},
"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: 3312/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 1406
lola: finding significant places
lola: 1406 places, 1906 transitions, 1005 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: (p1008 <= 1)
lola: LP says that atomic proposition is always true: (p1144 <= 1)
lola: E (F ((((1 <= p194)) AND ((p1008 <= 0)) AND ((1 <= p760)) AND ((p1144 <= 0)))))
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 ((((1 <= p194)) AND ((p1008 <= 0)) AND ((1 <= p760)) AND ((p1144 <= 0)))))
lola: processed formula length: 79
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: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p194)) AND ((p1008 <= 0)) AND ((1 <= p760)) AND ((p1144 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: local time limit reached - aborting
lola: memory consumption: 39920 KB
lola: time consumption: 6 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="ShieldRVs-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 ShieldRVs-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-162106594300087"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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