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.r227-tall-162098230900136.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2020
Input is ShieldIIPs-PT-020B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r227-tall-162098230900136
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 708K
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 131K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 10K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 91K 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.2K Mar 28 16:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 16:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 16:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Mar 27 11:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 27 11:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 25 17:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 25 17:41 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 332K 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 ShieldIIPs-PT-020B-ReachabilityFireability-00
FORMULA_NAME ShieldIIPs-PT-020B-ReachabilityFireability-01
FORMULA_NAME ShieldIIPs-PT-020B-ReachabilityFireability-02
FORMULA_NAME ShieldIIPs-PT-020B-ReachabilityFireability-03
FORMULA_NAME ShieldIIPs-PT-020B-ReachabilityFireability-04
FORMULA_NAME ShieldIIPs-PT-020B-ReachabilityFireability-05
FORMULA_NAME ShieldIIPs-PT-020B-ReachabilityFireability-06
FORMULA_NAME ShieldIIPs-PT-020B-ReachabilityFireability-07
FORMULA_NAME ShieldIIPs-PT-020B-ReachabilityFireability-08
FORMULA_NAME ShieldIIPs-PT-020B-ReachabilityFireability-09
FORMULA_NAME ShieldIIPs-PT-020B-ReachabilityFireability-10
FORMULA_NAME ShieldIIPs-PT-020B-ReachabilityFireability-11
FORMULA_NAME ShieldIIPs-PT-020B-ReachabilityFireability-12
FORMULA_NAME ShieldIIPs-PT-020B-ReachabilityFireability-13
FORMULA_NAME ShieldIIPs-PT-020B-ReachabilityFireability-14
FORMULA_NAME ShieldIIPs-PT-020B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1621131908164

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-16 02:25:09] [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]
[2021-05-16 02:25:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-16 02:25:09] [INFO ] Load time of PNML (sax parser for PT used): 102 ms
[2021-05-16 02:25:09] [INFO ] Transformed 1203 places.
[2021-05-16 02:25:09] [INFO ] Transformed 1183 transitions.
[2021-05-16 02:25:09] [INFO ] Found NUPN structural information;
[2021-05-16 02:25:09] [INFO ] Parsed PT model containing 1203 places and 1183 transitions in 176 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 49 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 3 resets, run finished after 119 ms. (steps per millisecond=84 ) properties seen :[1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1]
FORMULA ShieldIIPs-PT-020B-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-020B-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-020B-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-020B-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-020B-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-020B-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-020B-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-020B-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-020B-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-020B-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-020B-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-020B-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 36 ms. (steps per millisecond=277 ) properties seen :[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]
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]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 38 ms. (steps per millisecond=263 ) properties seen :[0, 0, 0, 0]
// Phase 1: matrix 1183 rows 1203 cols
[2021-05-16 02:25:10] [INFO ] Computed 181 place invariants in 38 ms
[2021-05-16 02:25:10] [INFO ] [Real]Absence check using 181 positive place invariants in 160 ms returned sat
[2021-05-16 02:25:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 02:25:13] [INFO ] [Real]Absence check using state equation in 2690 ms returned sat
[2021-05-16 02:25:14] [INFO ] Deduced a trap composed of 25 places in 566 ms
[2021-05-16 02:25:14] [INFO ] Deduced a trap composed of 26 places in 503 ms
[2021-05-16 02:25:15] [INFO ] Deduced a trap composed of 33 places in 540 ms
[2021-05-16 02:25:15] [INFO ] Deduced a trap composed of 26 places in 500 ms
[2021-05-16 02:25:15] [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 s672 s673 s698 s699 s701 s702 s720 s721 s722 s723 s727 s728 s729 s730 s749 s750 s751) 0)") while checking expression at index 0
[2021-05-16 02:25:16] [INFO ] [Real]Absence check using 181 positive place invariants in 139 ms returned sat
[2021-05-16 02:25:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 02:25:18] [INFO ] [Real]Absence check using state equation in 2667 ms returned sat
[2021-05-16 02:25:19] [INFO ] Deduced a trap composed of 22 places in 557 ms
[2021-05-16 02:25:19] [INFO ] Deduced a trap composed of 13 places in 497 ms
[2021-05-16 02:25:20] [INFO ] Deduced a trap composed of 26 places in 523 ms
[2021-05-16 02:25:21] [INFO ] Deduced a trap composed of 30 places in 497 ms
[2021-05-16 02:25: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: Stream closed (> (+ s0 s1 s1051 s1052 s1053 s1054 s1055 s1056 s1057 s1058 s1085 s1086 s1096 s1097 s1098 s1099 s1100 s1102 s1103 s1104 s1124 s1125 s1126 s1129 s1130 s1131 s1133 s1141 s1142 s1143) 0)") while checking expression at index 1
[2021-05-16 02:25:21] [INFO ] [Real]Absence check using 181 positive place invariants in 149 ms returned sat
[2021-05-16 02:25:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 02:25:24] [INFO ] [Real]Absence check using state equation in 2682 ms returned sat
[2021-05-16 02:25:24] [INFO ] Deduced a trap composed of 18 places in 493 ms
[2021-05-16 02:25:25] [INFO ] Deduced a trap composed of 16 places in 470 ms
[2021-05-16 02:25:25] [INFO ] Deduced a trap composed of 27 places in 441 ms
[2021-05-16 02:25:26] [INFO ] Deduced a trap composed of 17 places in 440 ms
[2021-05-16 02:25:26] [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 s1085 s1086 s1087 s1088 s1089 s1090 s1106 s1165 s1166 s1167 s1183 s1184 s1186 s1189 s1190) 0)") while checking expression at index 2
[2021-05-16 02:25:26] [INFO ] [Real]Absence check using 181 positive place invariants in 145 ms returned sat
[2021-05-16 02:25:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 02:25:28] [INFO ] [Real]Absence check using state equation in 2606 ms returned sat
[2021-05-16 02:25:29] [INFO ] Deduced a trap composed of 13 places in 461 ms
[2021-05-16 02:25:30] [INFO ] Deduced a trap composed of 21 places in 469 ms
[2021-05-16 02:25:30] [INFO ] Deduced a trap composed of 24 places in 458 ms
[2021-05-16 02:25:31] [INFO ] Deduced a trap composed of 21 places in 452 ms
[2021-05-16 02:25:31] [INFO ] Deduced a trap composed of 18 places in 437 ms
[2021-05-16 02:25:31] [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 s1085 s1086 s1087 s1088 s1089 s1090 s1091 s1103 s1105 s1111 s1112 s1114 s1115 s1162 s1163 s1164) 0)") while checking expression at index 3
Support contains 40 out of 1203 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1203/1203 places, 1183/1183 transitions.
Performed 98 Post agglomeration using F-continuation condition.Transition count delta: 98
Iterating post reduction 0 with 98 rules applied. Total rules applied 98 place count 1203 transition count 1085
Reduce places removed 98 places and 0 transitions.
Iterating post reduction 1 with 98 rules applied. Total rules applied 196 place count 1105 transition count 1085
Performed 98 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 98 Pre rules applied. Total rules applied 196 place count 1105 transition count 987
Deduced a syphon composed of 98 places in 3 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 2 with 196 rules applied. Total rules applied 392 place count 1007 transition count 987
Symmetric choice reduction at 2 with 136 rule applications. Total rules 528 place count 1007 transition count 987
Deduced a syphon composed of 136 places in 4 ms
Reduce places removed 136 places and 136 transitions.
Iterating global reduction 2 with 272 rules applied. Total rules applied 800 place count 871 transition count 851
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 800 place count 871 transition count 801
Deduced a syphon composed of 50 places in 3 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 900 place count 821 transition count 801
Performed 289 Post agglomeration using F-continuation condition.Transition count delta: 289
Deduced a syphon composed of 289 places in 1 ms
Reduce places removed 289 places and 0 transitions.
Iterating global reduction 2 with 578 rules applied. Total rules applied 1478 place count 532 transition count 512
Partial Free-agglomeration rule applied 129 times.
Drop transitions removed 129 transitions
Iterating global reduction 2 with 129 rules applied. Total rules applied 1607 place count 532 transition count 512
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 1608 place count 532 transition count 512
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1609 place count 531 transition count 511
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1610 place count 530 transition count 511
Applied a total of 1610 rules in 353 ms. Remains 530 /1203 variables (removed 673) and now considering 511/1183 (removed 672) transitions.
Finished structural reductions, in 1 iterations. Remains : 530/1203 places, 511/1183 transitions.
Incomplete random walk after 1000000 steps, including 581 resets, run finished after 6610 ms. (steps per millisecond=151 ) properties seen :[1, 0, 1, 1]
FORMULA ShieldIIPs-PT-020B-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-020B-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-020B-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 43 resets, run finished after 2995 ms. (steps per millisecond=333 ) properties seen :[0]
// Phase 1: matrix 511 rows 530 cols
[2021-05-16 02:25:41] [INFO ] Computed 180 place invariants in 27 ms
[2021-05-16 02:25:41] [INFO ] [Real]Absence check using 176 positive place invariants in 71 ms returned sat
[2021-05-16 02:25:41] [INFO ] [Real]Absence check using 176 positive and 4 generalized place invariants in 2 ms returned sat
[2021-05-16 02:25:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 02:25:42] [INFO ] [Real]Absence check using state equation in 565 ms returned sat
[2021-05-16 02:25:42] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 02:25:42] [INFO ] [Nat]Absence check using 176 positive place invariants in 70 ms returned sat
[2021-05-16 02:25:42] [INFO ] [Nat]Absence check using 176 positive and 4 generalized place invariants in 2 ms returned sat
[2021-05-16 02:25:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 02:25:42] [INFO ] [Nat]Absence check using state equation in 581 ms returned sat
[2021-05-16 02:25:43] [INFO ] Deduced a trap composed of 4 places in 61 ms
[2021-05-16 02:25:43] [INFO ] Deduced a trap composed of 5 places in 43 ms
[2021-05-16 02:25:43] [INFO ] Deduced a trap composed of 5 places in 40 ms
[2021-05-16 02:25:43] [INFO ] Deduced a trap composed of 3 places in 33 ms
[2021-05-16 02:25:43] [INFO ] Deduced a trap composed of 5 places in 36 ms
[2021-05-16 02:25:43] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 329 ms
[2021-05-16 02:25:43] [INFO ] Computed and/alt/rep : 496/1644/496 causal constraints in 43 ms.
[2021-05-16 02:25:54] [INFO ] Added : 484 causal constraints over 99 iterations in 11597 ms. Result :unknown
Incomplete Parikh walk after 39900 steps, including 358 resets, run finished after 284 ms. (steps per millisecond=140 ) properties seen :[0] could not realise parikh vector
Support contains 3 out of 530 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 530/530 places, 511/511 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 530 transition count 508
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 527 transition count 508
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 6 place count 527 transition count 498
Deduced a syphon composed of 10 places in 5 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 26 place count 517 transition count 498
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 2 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 50 place count 505 transition count 486
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 2 with 10 rules applied. Total rules applied 60 place count 505 transition count 486
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 61 place count 504 transition count 485
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 62 place count 503 transition count 484
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 63 place count 502 transition count 483
Applied a total of 63 rules in 114 ms. Remains 502 /530 variables (removed 28) and now considering 483/511 (removed 28) transitions.
Finished structural reductions, in 1 iterations. Remains : 502/530 places, 483/511 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 5426 ms. (steps per millisecond=184 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 2796 ms. (steps per millisecond=357 ) properties seen :[0]
Interrupted probabilistic random walk after 3087946 steps, run timeout after 30001 ms. (steps per millisecond=102 ) properties seen :[0]
Probabilistic random walk after 3087946 steps, saw 530673 distinct states, run finished after 30001 ms. (steps per millisecond=102 ) properties seen :[0]
// Phase 1: matrix 483 rows 502 cols
[2021-05-16 02:26:33] [INFO ] Computed 180 place invariants in 14 ms
[2021-05-16 02:26:33] [INFO ] [Real]Absence check using 178 positive place invariants in 70 ms returned sat
[2021-05-16 02:26:33] [INFO ] [Real]Absence check using 178 positive and 2 generalized place invariants in 2 ms returned sat
[2021-05-16 02:26:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 02:26:34] [INFO ] [Real]Absence check using state equation in 503 ms returned sat
[2021-05-16 02:26:34] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 02:26:34] [INFO ] [Nat]Absence check using 178 positive place invariants in 67 ms returned sat
[2021-05-16 02:26:34] [INFO ] [Nat]Absence check using 178 positive and 2 generalized place invariants in 1 ms returned sat
[2021-05-16 02:26:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 02:26:34] [INFO ] [Nat]Absence check using state equation in 536 ms returned sat
[2021-05-16 02:26:34] [INFO ] Deduced a trap composed of 6 places in 44 ms
[2021-05-16 02:26:34] [INFO ] Deduced a trap composed of 9 places in 44 ms
[2021-05-16 02:26:35] [INFO ] Deduced a trap composed of 4 places in 34 ms
[2021-05-16 02:26:35] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 176 ms
[2021-05-16 02:26:35] [INFO ] Computed and/alt/rep : 481/1557/481 causal constraints in 30 ms.
[2021-05-16 02:26:45] [INFO ] Added : 468 causal constraints over 94 iterations in 10163 ms. Result :unknown
Incomplete Parikh walk after 50900 steps, including 339 resets, run finished after 320 ms. (steps per millisecond=159 ) properties seen :[0] could not realise parikh vector
Support contains 3 out of 502 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 502/502 places, 483/483 transitions.
Applied a total of 0 rules in 36 ms. Remains 502 /502 variables (removed 0) and now considering 483/483 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 502/502 places, 483/483 transitions.
Starting structural reductions, iteration 0 : 502/502 places, 483/483 transitions.
Applied a total of 0 rules in 11 ms. Remains 502 /502 variables (removed 0) and now considering 483/483 (removed 0) transitions.
// Phase 1: matrix 483 rows 502 cols
[2021-05-16 02:26:45] [INFO ] Computed 180 place invariants in 7 ms
[2021-05-16 02:26:46] [INFO ] Implicit Places using invariants in 799 ms returned []
// Phase 1: matrix 483 rows 502 cols
[2021-05-16 02:26:46] [INFO ] Computed 180 place invariants in 4 ms
[2021-05-16 02:26:49] [INFO ] Implicit Places using invariants and state equation in 2666 ms returned []
Implicit Place search using SMT with State Equation took 3467 ms to find 0 implicit places.
[2021-05-16 02:26:49] [INFO ] Redundant transitions in 31 ms returned []
// Phase 1: matrix 483 rows 502 cols
[2021-05-16 02:26:49] [INFO ] Computed 180 place invariants in 4 ms
[2021-05-16 02:26:49] [INFO ] Dead Transitions using invariants and state equation in 732 ms returned []
Finished structural reductions, in 1 iterations. Remains : 502/502 places, 483/483 transitions.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 566 ms. (steps per millisecond=176 ) properties seen :[0]
// Phase 1: matrix 483 rows 502 cols
[2021-05-16 02:26:50] [INFO ] Computed 180 place invariants in 3 ms
[2021-05-16 02:26:50] [INFO ] [Real]Absence check using 178 positive place invariants in 71 ms returned sat
[2021-05-16 02:26:50] [INFO ] [Real]Absence check using 178 positive and 2 generalized place invariants in 2 ms returned sat
[2021-05-16 02:26:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 02:26:51] [INFO ] [Real]Absence check using state equation in 518 ms returned sat
[2021-05-16 02:26:51] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 02:26:51] [INFO ] [Nat]Absence check using 178 positive place invariants in 67 ms returned sat
[2021-05-16 02:26:51] [INFO ] [Nat]Absence check using 178 positive and 2 generalized place invariants in 1 ms returned sat
[2021-05-16 02:26:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 02:26:51] [INFO ] [Nat]Absence check using state equation in 528 ms returned sat
[2021-05-16 02:26:51] [INFO ] Deduced a trap composed of 6 places in 44 ms
[2021-05-16 02:26:51] [INFO ] Deduced a trap composed of 9 places in 42 ms
[2021-05-16 02:26:51] [INFO ] Deduced a trap composed of 4 places in 35 ms
[2021-05-16 02:26:51] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 178 ms
[2021-05-16 02:26:51] [INFO ] Computed and/alt/rep : 481/1557/481 causal constraints in 27 ms.
[2021-05-16 02:27:02] [INFO ] Added : 468 causal constraints over 94 iterations in 10206 ms. Result :unknown
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 502 transition count 483
Applied a total of 1 rules in 19 ms. Remains 502 /502 variables (removed 0) and now considering 483/483 (removed 0) transitions.
// Phase 1: matrix 483 rows 502 cols
[2021-05-16 02:27:02] [INFO ] Computed 180 place invariants in 4 ms
[2021-05-16 02:27:02] [INFO ] [Real]Absence check using 178 positive place invariants in 73 ms returned sat
[2021-05-16 02:27:02] [INFO ] [Real]Absence check using 178 positive and 2 generalized place invariants in 2 ms returned sat
[2021-05-16 02:27:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 02:27:02] [INFO ] [Real]Absence check using state equation in 537 ms returned sat
[2021-05-16 02:27:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-16 02:27:02] [INFO ] [Real]Added 1 Read/Feed constraints in 5 ms returned sat
[2021-05-16 02:27:02] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 02:27:02] [INFO ] [Nat]Absence check using 178 positive place invariants in 65 ms returned sat
[2021-05-16 02:27:02] [INFO ] [Nat]Absence check using 178 positive and 2 generalized place invariants in 1 ms returned sat
[2021-05-16 02:27:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 02:27:03] [INFO ] [Nat]Absence check using state equation in 514 ms returned sat
[2021-05-16 02:27:03] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-16 02:27:03] [INFO ] Deduced a trap composed of 15 places in 58 ms
[2021-05-16 02:27:03] [INFO ] Deduced a trap composed of 6 places in 43 ms
[2021-05-16 02:27:03] [INFO ] Deduced a trap composed of 9 places in 41 ms
[2021-05-16 02:27:03] [INFO ] Deduced a trap composed of 5 places in 44 ms
[2021-05-16 02:27:03] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 259 ms
[2021-05-16 02:27:03] [INFO ] Computed and/alt/rep : 481/1561/481 causal constraints in 24 ms.
[2021-05-16 02:27:13] [INFO ] Added : 465 causal constraints over 94 iterations in 9824 ms. Result :unknown
[2021-05-16 02:27:13] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 3 ms.
[2021-05-16 02:27:13] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 14 ms.
[2021-05-16 02:27:13] [INFO ] Flatten gal took : 88 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityFireability @ ShieldIIPs-PT-020B @ 3570 seconds
vrfy: finished
info: timeLeft: 3567
rslt: Output for ReachabilityFireability @ ShieldIIPs-PT-020B

{
"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",
"--safe",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--json=ReachabilityFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Sun May 16 02:27:14 2021
",
"timelimit": 3570
},
"child": null,
"exit":
{
"error": null,
"localtimelimitreached": true,
"memory": 20452,
"runtime": 3.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityFireability.xml",
"net": "model.pnml"
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p204) AND (1 <= p58) AND (1 <= p73))))",
"processed_size": 51,
"rewrites": 1,
"skeleton": "E(F(**))"
},
"net":
{
"arcs": 2291,
"conflict_clusters": 66,
"places": 502,
"places_significant": 322,
"singleton_clusters": 0,
"transitions": 483
},
"task":
{
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"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: 985/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 502
lola: finding significant places
lola: 502 places, 483 transitions, 322 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: (p204 <= 1)
lola: LP says that atomic proposition is always true: (p58 <= 1)
lola: LP says that atomic proposition is always true: (p73 <= 1)
lola: E (F (((1 <= p204) AND (1 <= p58) AND (1 <= p73))))
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 <= p204) AND (1 <= p58) AND (1 <= p73))))
lola: processed formula length: 51
lola: 1 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: 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: local time limit reached - aborting
lola: formula 0: ((1 <= p204) AND (1 <= p58) AND (1 <= p73))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-0.sara
lola: state equation: calling and running sara
lola: memory consumption: 20452 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="ShieldIIPs-PT-020B"
export BK_EXAMINATION="ReachabilityFireability"
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 ShieldIIPs-PT-020B, 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 r227-tall-162098230900136"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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