Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r211-tajo-159033478100887.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-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 itslola
Input is ShieldRVs-PT-040B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r211-tajo-159033478100887
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 668K
-rw-r--r-- 1 mcc users 3.7K May 14 02:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K May 14 02:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 13 19:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 13 19:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K May 14 10:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 14 10:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 14 10:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 14 10:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 3.2K May 13 14:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K May 13 14:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 13 09:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K May 13 09:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 13 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 13 16:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 20:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 12 20:42 instance
-rw-r--r-- 1 mcc users 6 May 12 20:42 iscolored
-rw-r--r-- 1 mcc users 498K May 12 20:42 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-040B-ReachabilityFireability-00
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityFireability-01
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityFireability-02
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityFireability-03
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityFireability-04
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityFireability-05
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityFireability-06
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityFireability-07
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityFireability-08
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityFireability-09
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityFireability-10
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityFireability-11
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityFireability-12
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityFireability-13
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityFireability-14
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1591332344505

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-05 04:45:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-05 04:45:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-05 04:45:46] [INFO ] Load time of PNML (sax parser for PT used): 155 ms
[2020-06-05 04:45:46] [INFO ] Transformed 1603 places.
[2020-06-05 04:45:46] [INFO ] Transformed 1803 transitions.
[2020-06-05 04:45:46] [INFO ] Found NUPN structural information;
[2020-06-05 04:45:46] [INFO ] Parsed PT model containing 1603 places and 1803 transitions in 238 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 64 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 5 resets, run finished after 105 ms. (steps per millisecond=95 ) properties seen :[1, 0, 1, 1, 1, 1, 0, 0, 1, 1, 0, 0, 1, 0, 1, 1]
FORMULA ShieldRVs-PT-040B-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040B-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040B-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040B-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040B-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040B-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040B-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040B-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040B-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040B-ReachabilityFireability-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]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 15 ms. (steps per millisecond=666 ) properties seen :[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]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 17 ms. (steps per millisecond=588 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 20 ms. (steps per millisecond=500 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 16 ms. (steps per millisecond=625 ) properties seen :[0, 0, 0, 0, 0, 0]
// Phase 1: matrix 1803 rows 1603 cols
[2020-06-05 04:45:46] [INFO ] Computed 161 place invariants in 44 ms
[2020-06-05 04:45:47] [INFO ] [Real]Absence check using 161 positive place invariants in 167 ms returned sat
[2020-06-05 04:45:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 04:45:51] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-05 04:45:51] [INFO ] [Real]Absence check using state equation in 4530 ms returned (error "Failed to check-sat")
[2020-06-05 04:45:52] [INFO ] [Real]Absence check using 161 positive place invariants in 142 ms returned sat
[2020-06-05 04:45:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 04:45:56] [INFO ] [Real]Absence check using state equation in 4492 ms returned sat
[2020-06-05 04:45:56] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 04:45:57] [INFO ] [Nat]Absence check using 161 positive place invariants in 181 ms returned sat
[2020-06-05 04:45:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 04:46:01] [INFO ] [Nat]Absence check using state equation in 4361 ms returned sat
[2020-06-05 04:46:02] [INFO ] Deduced a trap composed of 35 places in 1017 ms
[2020-06-05 04:46:02] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s1179 s1180 s1184 s1185 s1186 s1189 s1190 s1191 s1213 s1214 s1215 s1216 s1227 s1230 s1232 s1233 s1234 s1235 s1236 s1237 s1238 s1239 s1242 s1249 s1250) 0)") while checking expression at index 1
[2020-06-05 04:46:02] [INFO ] [Real]Absence check using 161 positive place invariants in 165 ms returned sat
[2020-06-05 04:46:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 04:46:07] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-05 04:46:07] [INFO ] [Real]Absence check using state equation in 4624 ms returned (error "Failed to check-sat")
[2020-06-05 04:46:07] [INFO ] [Real]Absence check using 161 positive place invariants in 140 ms returned sat
[2020-06-05 04:46:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 04:46:12] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-05 04:46:12] [INFO ] [Real]Absence check using state equation in 4622 ms returned (error "Failed to check-sat")
[2020-06-05 04:46:13] [INFO ] [Real]Absence check using 161 positive place invariants in 249 ms returned sat
[2020-06-05 04:46:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 04:46:17] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-05 04:46:17] [INFO ] [Real]Absence check using state equation in 4508 ms returned (error "Failed to check-sat")
[2020-06-05 04:46:18] [INFO ] [Real]Absence check using 161 positive place invariants in 142 ms returned sat
[2020-06-05 04:46:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 04:46:22] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-05 04:46:22] [INFO ] [Real]Absence check using state equation in 4612 ms returned (error "Failed to check-sat")
Support contains 25 out of 1603 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1603/1603 places, 1803/1803 transitions.
Performed 159 Post agglomeration using F-continuation condition.Transition count delta: 159
Iterating post reduction 0 with 159 rules applied. Total rules applied 159 place count 1603 transition count 1644
Reduce places removed 159 places and 0 transitions.
Iterating post reduction 1 with 159 rules applied. Total rules applied 318 place count 1444 transition count 1644
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 201 Pre rules applied. Total rules applied 318 place count 1444 transition count 1443
Deduced a syphon composed of 201 places in 5 ms
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 2 with 402 rules applied. Total rules applied 720 place count 1243 transition count 1443
Symmetric choice reduction at 2 with 271 rule applications. Total rules 991 place count 1243 transition count 1443
Deduced a syphon composed of 271 places in 5 ms
Reduce places removed 271 places and 271 transitions.
Iterating global reduction 2 with 542 rules applied. Total rules applied 1533 place count 972 transition count 1172
Performed 114 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 114 Pre rules applied. Total rules applied 1533 place count 972 transition count 1058
Deduced a syphon composed of 114 places in 4 ms
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 2 with 228 rules applied. Total rules applied 1761 place count 858 transition count 1058
Performed 278 Post agglomeration using F-continuation condition.Transition count delta: 278
Deduced a syphon composed of 278 places in 4 ms
Reduce places removed 278 places and 0 transitions.
Iterating global reduction 2 with 556 rules applied. Total rules applied 2317 place count 580 transition count 780
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 79 times.
Drop transitions removed 79 transitions
Iterating global reduction 2 with 79 rules applied. Total rules applied 2396 place count 580 transition count 780
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 2397 place count 579 transition count 779
Applied a total of 2397 rules in 527 ms. Remains 579 /1603 variables (removed 1024) and now considering 779/1803 (removed 1024) transitions.
Finished structural reductions, in 1 iterations. Remains : 579/1603 places, 779/1803 transitions.
Incomplete random walk after 1000000 steps, including 2030 resets, run finished after 4283 ms. (steps per millisecond=233 ) properties seen :[0, 1, 0, 0, 1, 1]
FORMULA ShieldRVs-PT-040B-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040B-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040B-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 193 resets, run finished after 2702 ms. (steps per millisecond=370 ) properties seen :[1, 0, 0]
FORMULA ShieldRVs-PT-040B-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 229 resets, run finished after 2121 ms. (steps per millisecond=471 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 221 resets, run finished after 1969 ms. (steps per millisecond=507 ) properties seen :[0, 1]
FORMULA ShieldRVs-PT-040B-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 779 rows 579 cols
[2020-06-05 04:46:34] [INFO ] Computed 161 place invariants in 3 ms
[2020-06-05 04:46:34] [INFO ] [Real]Absence check using 161 positive place invariants in 70 ms returned sat
[2020-06-05 04:46:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 04:46:35] [INFO ] [Real]Absence check using state equation in 668 ms returned sat
[2020-06-05 04:46:35] [INFO ] Deduced a trap composed of 10 places in 131 ms
[2020-06-05 04:46:35] [INFO ] Deduced a trap composed of 7 places in 193 ms
[2020-06-05 04:46:35] [INFO ] Deduced a trap composed of 19 places in 165 ms
[2020-06-05 04:46:35] [INFO ] Deduced a trap composed of 17 places in 197 ms
[2020-06-05 04:46:36] [INFO ] Deduced a trap composed of 28 places in 152 ms
[2020-06-05 04:46:36] [INFO ] Deduced a trap composed of 15 places in 154 ms
[2020-06-05 04:46:36] [INFO ] Deduced a trap composed of 14 places in 149 ms
[2020-06-05 04:46:36] [INFO ] Deduced a trap composed of 17 places in 149 ms
[2020-06-05 04:46:36] [INFO ] Deduced a trap composed of 16 places in 140 ms
[2020-06-05 04:46:36] [INFO ] Deduced a trap composed of 6 places in 143 ms
[2020-06-05 04:46:37] [INFO ] Deduced a trap composed of 9 places in 121 ms
[2020-06-05 04:46:37] [INFO ] Deduced a trap composed of 14 places in 120 ms
[2020-06-05 04:46:37] [INFO ] Deduced a trap composed of 7 places in 111 ms
[2020-06-05 04:46:37] [INFO ] Deduced a trap composed of 12 places in 110 ms
[2020-06-05 04:46:37] [INFO ] Deduced a trap composed of 13 places in 137 ms
[2020-06-05 04:46:37] [INFO ] Deduced a trap composed of 7 places in 110 ms
[2020-06-05 04:46:37] [INFO ] Deduced a trap composed of 12 places in 98 ms
[2020-06-05 04:46:37] [INFO ] Deduced a trap composed of 11 places in 97 ms
[2020-06-05 04:46:38] [INFO ] Deduced a trap composed of 7 places in 62 ms
[2020-06-05 04:46:38] [INFO ] Deduced a trap composed of 6 places in 59 ms
[2020-06-05 04:46:38] [INFO ] Deduced a trap composed of 24 places in 32 ms
[2020-06-05 04:46:38] [INFO ] Deduced a trap composed of 15 places in 32 ms
[2020-06-05 04:46:38] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 3160 ms
[2020-06-05 04:46:38] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 04:46:38] [INFO ] [Nat]Absence check using 161 positive place invariants in 85 ms returned sat
[2020-06-05 04:46:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 04:46:39] [INFO ] [Nat]Absence check using state equation in 932 ms returned sat
[2020-06-05 04:46:39] [INFO ] Deduced a trap composed of 14 places in 203 ms
[2020-06-05 04:46:39] [INFO ] Deduced a trap composed of 12 places in 128 ms
[2020-06-05 04:46:39] [INFO ] Deduced a trap composed of 7 places in 120 ms
[2020-06-05 04:46:40] [INFO ] Deduced a trap composed of 7 places in 115 ms
[2020-06-05 04:46:40] [INFO ] Deduced a trap composed of 12 places in 109 ms
[2020-06-05 04:46:40] [INFO ] Deduced a trap composed of 7 places in 107 ms
[2020-06-05 04:46:40] [INFO ] Deduced a trap composed of 11 places in 240 ms
[2020-06-05 04:46:40] [INFO ] Deduced a trap composed of 6 places in 270 ms
[2020-06-05 04:46:41] [INFO ] Deduced a trap composed of 6 places in 190 ms
[2020-06-05 04:46:41] [INFO ] Deduced a trap composed of 9 places in 67 ms
[2020-06-05 04:46:41] [INFO ] Deduced a trap composed of 10 places in 75 ms
[2020-06-05 04:46:41] [INFO ] Deduced a trap composed of 10 places in 67 ms
[2020-06-05 04:46:41] [INFO ] Deduced a trap composed of 9 places in 82 ms
[2020-06-05 04:46:41] [INFO ] Deduced a trap composed of 15 places in 53 ms
[2020-06-05 04:46:41] [INFO ] Deduced a trap composed of 6 places in 62 ms
[2020-06-05 04:46:41] [INFO ] Deduced a trap composed of 10 places in 60 ms
[2020-06-05 04:46:41] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 2461 ms
[2020-06-05 04:46:41] [INFO ] Computed and/alt/rep : 772/4242/772 causal constraints in 50 ms.
[2020-06-05 04:47:01] [INFO ] Added : 690 causal constraints over 138 iterations in 20122 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 120 ms.
Incomplete Parikh walk after 71700 steps, including 1018 resets, run finished after 554 ms. (steps per millisecond=129 ) properties seen :[0] could not realise parikh vector
Support contains 4 out of 579 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 579/579 places, 779/779 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 579 transition count 778
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 578 transition count 778
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 20 place count 569 transition count 769
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 23 place count 569 transition count 769
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 568 transition count 768
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 25 place count 567 transition count 767
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 566 transition count 766
Applied a total of 26 rules in 265 ms. Remains 566 /579 variables (removed 13) and now considering 766/779 (removed 13) transitions.
Finished structural reductions, in 1 iterations. Remains : 566/579 places, 766/779 transitions.
Incomplete random walk after 1000000 steps, including 2111 resets, run finished after 3935 ms. (steps per millisecond=254 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 244 resets, run finished after 2050 ms. (steps per millisecond=487 ) properties seen :[0]
Interrupted probabilistic random walk after 4014425 steps, run timeout after 30001 ms. (steps per millisecond=133 ) properties seen :[0]
Probabilistic random walk after 4014425 steps, saw 490881 distinct states, run finished after 30001 ms. (steps per millisecond=133 ) properties seen :[0]
// Phase 1: matrix 766 rows 566 cols
[2020-06-05 04:47:38] [INFO ] Computed 161 place invariants in 6 ms
[2020-06-05 04:47:39] [INFO ] [Real]Absence check using 161 positive place invariants in 73 ms returned sat
[2020-06-05 04:47:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 04:47:39] [INFO ] [Real]Absence check using state equation in 646 ms returned sat
[2020-06-05 04:47:39] [INFO ] Deduced a trap composed of 9 places in 65 ms
[2020-06-05 04:47:40] [INFO ] Deduced a trap composed of 7 places in 102 ms
[2020-06-05 04:47:40] [INFO ] Deduced a trap composed of 12 places in 82 ms
[2020-06-05 04:47:40] [INFO ] Deduced a trap composed of 8 places in 74 ms
[2020-06-05 04:47:40] [INFO ] Deduced a trap composed of 12 places in 70 ms
[2020-06-05 04:47:40] [INFO ] Deduced a trap composed of 11 places in 77 ms
[2020-06-05 04:47:40] [INFO ] Deduced a trap composed of 15 places in 72 ms
[2020-06-05 04:47:40] [INFO ] Deduced a trap composed of 25 places in 39 ms
[2020-06-05 04:47:40] [INFO ] Deduced a trap composed of 21 places in 72 ms
[2020-06-05 04:47:40] [INFO ] Deduced a trap composed of 7 places in 72 ms
[2020-06-05 04:47:40] [INFO ] Deduced a trap composed of 10 places in 71 ms
[2020-06-05 04:47:40] [INFO ] Deduced a trap composed of 23 places in 42 ms
[2020-06-05 04:47:40] [INFO ] Deduced a trap composed of 27 places in 32 ms
[2020-06-05 04:47:41] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1152 ms
[2020-06-05 04:47:41] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 04:47:41] [INFO ] [Nat]Absence check using 161 positive place invariants in 79 ms returned sat
[2020-06-05 04:47:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 04:47:42] [INFO ] [Nat]Absence check using state equation in 951 ms returned sat
[2020-06-05 04:47:42] [INFO ] Deduced a trap composed of 9 places in 118 ms
[2020-06-05 04:47:42] [INFO ] Deduced a trap composed of 7 places in 83 ms
[2020-06-05 04:47:42] [INFO ] Deduced a trap composed of 7 places in 82 ms
[2020-06-05 04:47:42] [INFO ] Deduced a trap composed of 12 places in 74 ms
[2020-06-05 04:47:42] [INFO ] Deduced a trap composed of 10 places in 76 ms
[2020-06-05 04:47:42] [INFO ] Deduced a trap composed of 22 places in 70 ms
[2020-06-05 04:47:42] [INFO ] Deduced a trap composed of 25 places in 74 ms
[2020-06-05 04:47:42] [INFO ] Deduced a trap composed of 15 places in 65 ms
[2020-06-05 04:47:43] [INFO ] Deduced a trap composed of 23 places in 69 ms
[2020-06-05 04:47:43] [INFO ] Deduced a trap composed of 29 places in 99 ms
[2020-06-05 04:47:43] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1110 ms
[2020-06-05 04:47:43] [INFO ] Computed and/alt/rep : 763/4099/763 causal constraints in 97 ms.
[2020-06-05 04:48:04] [INFO ] Added : 705 causal constraints over 141 iterations in 21684 ms.(timeout) Result :sat
[2020-06-05 04:48:05] [INFO ] Deduced a trap composed of 10 places in 103 ms
[2020-06-05 04:48:05] [INFO ] Deduced a trap composed of 8 places in 113 ms
[2020-06-05 04:48:05] [INFO ] Deduced a trap composed of 6 places in 68 ms
[2020-06-05 04:48:05] [INFO ] Deduced a trap composed of 10 places in 48 ms
[2020-06-05 04:48:05] [INFO ] Deduced a trap composed of 9 places in 67 ms
[2020-06-05 04:48:06] [INFO ] Deduced a trap composed of 6 places in 31 ms
[2020-06-05 04:48:06] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1205 ms
Attempting to minimize the solution found.
Minimization took 78 ms.
Incomplete Parikh walk after 86000 steps, including 973 resets, run finished after 556 ms. (steps per millisecond=154 ) properties seen :[0] could not realise parikh vector
Support contains 4 out of 566 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 566/566 places, 766/766 transitions.
Applied a total of 0 rules in 18 ms. Remains 566 /566 variables (removed 0) and now considering 766/766 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 566/566 places, 766/766 transitions.
Starting structural reductions, iteration 0 : 566/566 places, 766/766 transitions.
Applied a total of 0 rules in 18 ms. Remains 566 /566 variables (removed 0) and now considering 766/766 (removed 0) transitions.
// Phase 1: matrix 766 rows 566 cols
[2020-06-05 04:48:06] [INFO ] Computed 161 place invariants in 7 ms
[2020-06-05 04:48:07] [INFO ] Implicit Places using invariants in 1025 ms returned []
// Phase 1: matrix 766 rows 566 cols
[2020-06-05 04:48:07] [INFO ] Computed 161 place invariants in 5 ms
[2020-06-05 04:48:11] [INFO ] Implicit Places using invariants and state equation in 3154 ms returned []
Implicit Place search using SMT with State Equation took 4179 ms to find 0 implicit places.
[2020-06-05 04:48:11] [INFO ] Redundant transitions in 519 ms returned []
// Phase 1: matrix 766 rows 566 cols
[2020-06-05 04:48:11] [INFO ] Computed 161 place invariants in 3 ms
[2020-06-05 04:48:12] [INFO ] Dead Transitions using invariants and state equation in 1135 ms returned []
Finished structural reductions, in 1 iterations. Remains : 566/566 places, 766/766 transitions.
Incomplete random walk after 100000 steps, including 210 resets, run finished after 344 ms. (steps per millisecond=290 ) properties seen :[0]
// Phase 1: matrix 766 rows 566 cols
[2020-06-05 04:48:13] [INFO ] Computed 161 place invariants in 3 ms
[2020-06-05 04:48:13] [INFO ] [Real]Absence check using 161 positive place invariants in 84 ms returned sat
[2020-06-05 04:48:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 04:48:14] [INFO ] [Real]Absence check using state equation in 763 ms returned sat
[2020-06-05 04:48:14] [INFO ] Deduced a trap composed of 9 places in 96 ms
[2020-06-05 04:48:14] [INFO ] Deduced a trap composed of 7 places in 102 ms
[2020-06-05 04:48:14] [INFO ] Deduced a trap composed of 12 places in 83 ms
[2020-06-05 04:48:14] [INFO ] Deduced a trap composed of 8 places in 90 ms
[2020-06-05 04:48:14] [INFO ] Deduced a trap composed of 12 places in 74 ms
[2020-06-05 04:48:14] [INFO ] Deduced a trap composed of 11 places in 91 ms
[2020-06-05 04:48:14] [INFO ] Deduced a trap composed of 15 places in 85 ms
[2020-06-05 04:48:14] [INFO ] Deduced a trap composed of 25 places in 86 ms
[2020-06-05 04:48:15] [INFO ] Deduced a trap composed of 21 places in 52 ms
[2020-06-05 04:48:15] [INFO ] Deduced a trap composed of 7 places in 71 ms
[2020-06-05 04:48:15] [INFO ] Deduced a trap composed of 10 places in 60 ms
[2020-06-05 04:48:15] [INFO ] Deduced a trap composed of 23 places in 32 ms
[2020-06-05 04:48:15] [INFO ] Deduced a trap composed of 27 places in 62 ms
[2020-06-05 04:48:15] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1342 ms
[2020-06-05 04:48:15] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 04:48:15] [INFO ] [Nat]Absence check using 161 positive place invariants in 145 ms returned sat
[2020-06-05 04:48:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 04:48:16] [INFO ] [Nat]Absence check using state equation in 940 ms returned sat
[2020-06-05 04:48:16] [INFO ] Deduced a trap composed of 9 places in 83 ms
[2020-06-05 04:48:16] [INFO ] Deduced a trap composed of 7 places in 78 ms
[2020-06-05 04:48:16] [INFO ] Deduced a trap composed of 7 places in 61 ms
[2020-06-05 04:48:17] [INFO ] Deduced a trap composed of 12 places in 64 ms
[2020-06-05 04:48:17] [INFO ] Deduced a trap composed of 10 places in 62 ms
[2020-06-05 04:48:17] [INFO ] Deduced a trap composed of 22 places in 62 ms
[2020-06-05 04:48:17] [INFO ] Deduced a trap composed of 25 places in 58 ms
[2020-06-05 04:48:17] [INFO ] Deduced a trap composed of 15 places in 45 ms
[2020-06-05 04:48:17] [INFO ] Deduced a trap composed of 23 places in 43 ms
[2020-06-05 04:48:17] [INFO ] Deduced a trap composed of 29 places in 44 ms
[2020-06-05 04:48:17] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 844 ms
[2020-06-05 04:48:17] [INFO ] Computed and/alt/rep : 763/4099/763 causal constraints in 51 ms.
[2020-06-05 04:48:35] [INFO ] Added : 700 causal constraints over 140 iterations in 17894 ms. Result :(error "Solver has unexpectedly terminated")
Applied a total of 0 rules in 23 ms. Remains 566 /566 variables (removed 0) and now considering 766/766 (removed 0) transitions.
// Phase 1: matrix 766 rows 566 cols
[2020-06-05 04:48:35] [INFO ] Computed 161 place invariants in 3 ms
[2020-06-05 04:48:35] [INFO ] [Real]Absence check using 161 positive place invariants in 103 ms returned sat
[2020-06-05 04:48:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 04:48:36] [INFO ] [Real]Absence check using state equation in 1062 ms returned sat
[2020-06-05 04:48:36] [INFO ] Deduced a trap composed of 9 places in 101 ms
[2020-06-05 04:48:36] [INFO ] Deduced a trap composed of 7 places in 63 ms
[2020-06-05 04:48:37] [INFO ] Deduced a trap composed of 12 places in 58 ms
[2020-06-05 04:48:37] [INFO ] Deduced a trap composed of 8 places in 65 ms
[2020-06-05 04:48:37] [INFO ] Deduced a trap composed of 12 places in 66 ms
[2020-06-05 04:48:37] [INFO ] Deduced a trap composed of 11 places in 55 ms
[2020-06-05 04:48:37] [INFO ] Deduced a trap composed of 15 places in 49 ms
[2020-06-05 04:48:37] [INFO ] Deduced a trap composed of 25 places in 58 ms
[2020-06-05 04:48:37] [INFO ] Deduced a trap composed of 21 places in 55 ms
[2020-06-05 04:48:37] [INFO ] Deduced a trap composed of 7 places in 62 ms
[2020-06-05 04:48:37] [INFO ] Deduced a trap composed of 10 places in 46 ms
[2020-06-05 04:48:37] [INFO ] Deduced a trap composed of 23 places in 44 ms
[2020-06-05 04:48:37] [INFO ] Deduced a trap composed of 27 places in 25 ms
[2020-06-05 04:48:37] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1038 ms
[2020-06-05 04:48:37] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 04:48:37] [INFO ] [Nat]Absence check using 161 positive place invariants in 68 ms returned sat
[2020-06-05 04:48:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 04:48:38] [INFO ] [Nat]Absence check using state equation in 657 ms returned sat
[2020-06-05 04:48:38] [INFO ] Deduced a trap composed of 9 places in 87 ms
[2020-06-05 04:48:38] [INFO ] Deduced a trap composed of 7 places in 67 ms
[2020-06-05 04:48:38] [INFO ] Deduced a trap composed of 7 places in 65 ms
[2020-06-05 04:48:38] [INFO ] Deduced a trap composed of 12 places in 56 ms
[2020-06-05 04:48:39] [INFO ] Deduced a trap composed of 10 places in 49 ms
[2020-06-05 04:48:39] [INFO ] Deduced a trap composed of 22 places in 44 ms
[2020-06-05 04:48:39] [INFO ] Deduced a trap composed of 25 places in 53 ms
[2020-06-05 04:48:39] [INFO ] Deduced a trap composed of 15 places in 47 ms
[2020-06-05 04:48:39] [INFO ] Deduced a trap composed of 23 places in 41 ms
[2020-06-05 04:48:39] [INFO ] Deduced a trap composed of 29 places in 35 ms
[2020-06-05 04:48:39] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 759 ms
[2020-06-05 04:48:39] [INFO ] Computed and/alt/rep : 763/4099/763 causal constraints in 40 ms.
[2020-06-05 04:49:00] [INFO ] Added : 705 causal constraints over 141 iterations in 21440 ms.(timeout) Result :sat
[2020-06-05 04:49:00] [INFO ] Deduced a trap composed of 10 places in 71 ms
[2020-06-05 04:49:01] [INFO ] Deduced a trap composed of 8 places in 75 ms
[2020-06-05 04:49:01] [INFO ] Deduced a trap composed of 6 places in 49 ms
[2020-06-05 04:49:01] [INFO ] Deduced a trap composed of 10 places in 57 ms
[2020-06-05 04:49:01] [INFO ] Deduced a trap composed of 9 places in 60 ms
[2020-06-05 04:49:01] [INFO ] Deduced a trap composed of 6 places in 40 ms
[2020-06-05 04:49:01] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1099 ms
Attempting to minimize the solution found.
Minimization took 97 ms.
[2020-06-05 04:49:02] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 3 ms.
[2020-06-05 04:49:02] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 36 ms.
[2020-06-05 04:49:02] [INFO ] Flatten gal took : 224 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityFireability @ ShieldRVs-PT-040B @ 3570 seconds

FORMULA ShieldRVs-PT-040B-ReachabilityFireability-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS SYMMETRIES TOPOLOGICAL USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3567
rslt: Output for ReachabilityFireability @ ShieldRVs-PT-040B

{
"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=ReachabilityFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--json=ReachabilityFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Fri Jun 5 04:49:02 2020
",
"timelimit": 3570
},
"child": null,
"exit":
{
"error": null,
"localtimelimitreached": true,
"memory": 23404,
"runtime": 3.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityFireability.xml",
"net": "model.pnml"
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 3,
"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": "A (G (((p222 <= 0) OR (p304 <= 0) OR (((p436 <= 0)) AND ((p384 <= 0))))))",
"processed_size": 75,
"rewrites": 2,
"skeleton": "A(G(**))"
},
"net":
{
"arcs": 3695,
"conflict_clusters": 45,
"places": 566,
"places_significant": 405,
"singleton_clusters": 0,
"transitions": 766
},
"result":
{
"edges": 2,
"markings": 3,
"produced_by": "state space",
"value": true
},
"task":
{
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 6,
"problems": 2
},
"type": "invariance",
"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: 1332/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 18112
lola: finding significant places
lola: 566 places, 766 transitions, 405 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 ReachabilityFireability.xml
lola: LP says that atomic proposition is always true: (p222 <= 1)
lola: LP says that atomic proposition is always true: (p304 <= 1)
lola: LP says that atomic proposition is always true: (p436 <= 1)
lola: LP says that atomic proposition is always true: (p384 <= 1)
lola: A (G (((p222 <= 0) OR (p304 <= 0) OR (((p436 <= 0)) AND ((p384 <= 0))))))
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((p222 <= 0) OR (p304 <= 0) OR (((p436 <= 0)) AND ((p384 <= 0))))))
lola: processed formula length: 75
lola: 2 rewrites
lola: closed formula file ReachabilityFireability.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: RESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 3 markings, 2 edges
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p222) AND (1 <= p304) AND (((1 <= p436)) OR ((1 <= p384))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-0.sara
lola: state equation: calling and running sara
lola: memory consumption: 23404 KB
lola: time consumption: 3 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityFireability.json
lola: closed JSON file ReachabilityFireability.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-040B"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itslola"
echo " Input is ShieldRVs-PT-040B, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r211-tajo-159033478100887"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVs-PT-040B.tgz
mv ShieldRVs-PT-040B execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;