About the Execution of 2020-gold for CloudDeployment-PT-4b
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
4288.371 | 3600000.00 | 187069.00 | 198.50 | ?TFFTFTFFFTFTTFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fko/mcc2021-input.r056-oct2-162038334700156.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/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 CloudDeployment-PT-4b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r056-oct2-162038334700156
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 952K
-rw-r--r-- 1 mcc users 15K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 136K May 10 09:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.9K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K May 10 09:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Mar 28 15:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Mar 28 15:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 15:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 15:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 23 03:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 23 03:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 22 12:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 22 12:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 591K May 5 16:51 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME CloudDeployment-PT-4b-ReachabilityFireability-00
FORMULA_NAME CloudDeployment-PT-4b-ReachabilityFireability-01
FORMULA_NAME CloudDeployment-PT-4b-ReachabilityFireability-02
FORMULA_NAME CloudDeployment-PT-4b-ReachabilityFireability-03
FORMULA_NAME CloudDeployment-PT-4b-ReachabilityFireability-04
FORMULA_NAME CloudDeployment-PT-4b-ReachabilityFireability-05
FORMULA_NAME CloudDeployment-PT-4b-ReachabilityFireability-06
FORMULA_NAME CloudDeployment-PT-4b-ReachabilityFireability-07
FORMULA_NAME CloudDeployment-PT-4b-ReachabilityFireability-08
FORMULA_NAME CloudDeployment-PT-4b-ReachabilityFireability-09
FORMULA_NAME CloudDeployment-PT-4b-ReachabilityFireability-10
FORMULA_NAME CloudDeployment-PT-4b-ReachabilityFireability-11
FORMULA_NAME CloudDeployment-PT-4b-ReachabilityFireability-12
FORMULA_NAME CloudDeployment-PT-4b-ReachabilityFireability-13
FORMULA_NAME CloudDeployment-PT-4b-ReachabilityFireability-14
FORMULA_NAME CloudDeployment-PT-4b-ReachabilityFireability-15
=== Now, execution of the tool begins
BK_START 1620900068625
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-13 10:01:11] [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-13 10:01:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 10:01:11] [INFO ] Load time of PNML (sax parser for PT used): 200 ms
[2021-05-13 10:01:11] [INFO ] Transformed 1182 places.
[2021-05-13 10:01:11] [INFO ] Transformed 1824 transitions.
[2021-05-13 10:01:11] [INFO ] Found NUPN structural information;
[2021-05-13 10:01:11] [INFO ] Parsed PT model containing 1182 places and 1824 transitions in 278 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 67 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 76 resets, run finished after 114 ms. (steps per millisecond=87 ) properties seen :[0, 1, 1, 0, 1, 0, 1, 1, 0, 0, 1, 0, 0, 1, 0, 0]
FORMULA CloudDeployment-PT-4b-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-4b-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-4b-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-4b-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-4b-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-4b-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-4b-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 54 ms. (steps per millisecond=185 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 13 ms. (steps per millisecond=769 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 16 ms. (steps per millisecond=625 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 33 ms. (steps per millisecond=303 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 21 ms. (steps per millisecond=476 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 41 ms. (steps per millisecond=243 ) properties seen :[0, 1, 0, 0, 0, 0, 0, 0, 0]
FORMULA CloudDeployment-PT-4b-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 27 ms. (steps per millisecond=370 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 1824 rows 1182 cols
[2021-05-13 10:01:11] [INFO ] Computed 17 place invariants in 37 ms
[2021-05-13 10:01:12] [INFO ] [Real]Absence check using 0 positive and 17 generalized place invariants in 93 ms returned sat
[2021-05-13 10:01:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:01:16] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe (= s697 (- t4 t485))") while checking expression at index 0
[2021-05-13 10:01:17] [INFO ] [Real]Absence check using 0 positive and 17 generalized place invariants in 71 ms returned sat
[2021-05-13 10:01:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:01:18] [INFO ] [Real]Absence check using state equation in 1176 ms returned unsat
[2021-05-13 10:01:18] [INFO ] [Real]Absence check using 0 positive and 17 generalized place invariants in 47 ms returned sat
[2021-05-13 10:01:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:01:22] [INFO ] [Real]Absence check using state equation in 3348 ms returned sat
[2021-05-13 10:01:22] [INFO ] Computed and/alt/rep : 1823/8595/1823 causal constraints in 214 ms.
[2021-05-13 10:01:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:01:23] [INFO ] [Nat]Absence check using 0 positive and 17 generalized place invariants in 60 ms returned sat
[2021-05-13 10:01:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:01:26] [INFO ] [Nat]Absence check using state equation in 2954 ms returned sat
[2021-05-13 10:01:26] [INFO ] Computed and/alt/rep : 1823/8595/1823 causal constraints in 186 ms.
[2021-05-13 10:01:27] [INFO ] Added : 95 causal constraints over 19 iterations in 1654 ms. Result :(error "Failed to check-sat")
[2021-05-13 10:01:27] [INFO ] [Real]Absence check using 0 positive and 17 generalized place invariants in 45 ms returned sat
[2021-05-13 10:01:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:01:28] [INFO ] [Real]Absence check using state equation in 293 ms returned unsat
[2021-05-13 10:01:28] [INFO ] [Real]Absence check using 0 positive and 17 generalized place invariants in 83 ms returned sat
[2021-05-13 10:01:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:01:32] [INFO ] [Real]Absence check using state equation in 3498 ms returned sat
[2021-05-13 10:01:32] [INFO ] Computed and/alt/rep : 1823/8595/1823 causal constraints in 211 ms.
[2021-05-13 10:01:33] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:01:33] [INFO ] [Nat]Absence check using 0 positive and 17 generalized place invariants in 227 ms returned sat
[2021-05-13 10:01:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:01:37] [INFO ] [Nat]Absence check using state equation in 4409 ms returned sat
[2021-05-13 10:01:38] [INFO ] Computed and/alt/rep : 1823/8595/1823 causal constraints in 86 ms.
[2021-05-13 10:01:38] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe (=> (> t12 0) (and (> t9 0) (< o9 o12)))") while checking expression at index 4
[2021-05-13 10:01:38] [INFO ] [Real]Absence check using 0 positive and 17 generalized place invariants in 63 ms returned sat
[2021-05-13 10:01:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:01:38] [INFO ] [Real]Absence check using state equation in 248 ms returned unsat
[2021-05-13 10:01:38] [INFO ] [Real]Absence check using 0 positive and 17 generalized place invariants in 72 ms returned sat
[2021-05-13 10:01:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:01:41] [INFO ] [Real]Absence check using state equation in 2817 ms returned sat
[2021-05-13 10:01:41] [INFO ] Computed and/alt/rep : 1823/8595/1823 causal constraints in 110 ms.
[2021-05-13 10:01:42] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:01:42] [INFO ] [Nat]Absence check using 0 positive and 17 generalized place invariants in 99 ms returned sat
[2021-05-13 10:01:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:01:44] [INFO ] [Nat]Absence check using state equation in 2584 ms returned sat
[2021-05-13 10:01:45] [INFO ] Computed and/alt/rep : 1823/8595/1823 causal constraints in 159 ms.
[2021-05-13 10:01:47] [INFO ] Added : 95 causal constraints over 19 iterations in 2244 ms. Result :(error "Failed to check-sat")
[2021-05-13 10:01:47] [INFO ] [Real]Absence check using 0 positive and 17 generalized place invariants in 80 ms returned sat
[2021-05-13 10:01:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:01:47] [INFO ] [Real]Absence check using state equation in 341 ms returned unsat
FORMULA CloudDeployment-PT-4b-ReachabilityFireability-15 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA CloudDeployment-PT-4b-ReachabilityFireability-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA CloudDeployment-PT-4b-ReachabilityFireability-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA CloudDeployment-PT-4b-ReachabilityFireability-05 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Support contains 30 out of 1182 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1182/1182 places, 1824/1824 transitions.
Graph (trivial) has 1160 edges and 1182 vertex of which 278 / 1182 are part of one of the 27 SCC in 28 ms
Free SCC test removed 251 places
Discarding 8 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Graph (complete) has 2417 edges and 931 vertex of which 923 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.14 ms
Drop transitions removed 311 transitions
Reduce isomorphic transitions removed 311 transitions.
Performed 458 Post agglomeration using F-continuation condition.Transition count delta: 458
Iterating post reduction 0 with 769 rules applied. Total rules applied 771 place count 923 transition count 1051
Reduce places removed 458 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 464 rules applied. Total rules applied 1235 place count 465 transition count 1045
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1236 place count 464 transition count 1045
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 1236 place count 464 transition count 1028
Deduced a syphon composed of 17 places in 2 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 1270 place count 447 transition count 1028
Symmetric choice reduction at 3 with 161 rule applications. Total rules 1431 place count 447 transition count 1028
Deduced a syphon composed of 161 places in 1 ms
Reduce places removed 161 places and 161 transitions.
Iterating global reduction 3 with 322 rules applied. Total rules applied 1753 place count 286 transition count 867
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 1765 place count 286 transition count 855
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 14 Pre rules applied. Total rules applied 1765 place count 286 transition count 841
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 1793 place count 272 transition count 841
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1795 place count 272 transition count 841
Deduced a syphon composed of 2 places in 14 ms
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 1799 place count 270 transition count 839
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1800 place count 270 transition count 839
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1802 place count 269 transition count 838
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Deduced a syphon composed of 71 places in 0 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 4 with 142 rules applied. Total rules applied 1944 place count 198 transition count 767
Performed 29 Post agglomeration using F-continuation condition with reduction of 53 identical transitions.
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 4 with 58 rules applied. Total rules applied 2002 place count 169 transition count 878
Free-agglomeration rule applied 22 times.
Iterating global reduction 4 with 22 rules applied. Total rules applied 2024 place count 169 transition count 856
Reduce places removed 22 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 4 with 52 rules applied. Total rules applied 2076 place count 147 transition count 826
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 2078 place count 147 transition count 826
Partial Post-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 2082 place count 147 transition count 826
Drop transitions removed 1 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 2085 place count 147 transition count 823
Drop transitions removed 45 transitions
Redundant transition composition rules discarded 45 transitions
Iterating global reduction 6 with 45 rules applied. Total rules applied 2130 place count 147 transition count 778
Applied a total of 2130 rules in 366 ms. Remains 147 /1182 variables (removed 1035) and now considering 778/1824 (removed 1046) transitions.
Finished structural reductions, in 1 iterations. Remains : 147/1182 places, 778/1824 transitions.
Incomplete random walk after 1000000 steps, including 19654 resets, run finished after 2800 ms. (steps per millisecond=357 ) properties seen :[0, 1, 0, 0]
FORMULA CloudDeployment-PT-4b-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 1706 resets, run finished after 872 ms. (steps per millisecond=1146 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 1463 resets, run finished after 437 ms. (steps per millisecond=2288 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 1267 resets, run finished after 508 ms. (steps per millisecond=1968 ) properties seen :[0, 0, 0]
[2021-05-13 10:01:52] [INFO ] Flow matrix only has 663 transitions (discarded 115 similar events)
// Phase 1: matrix 663 rows 147 cols
[2021-05-13 10:01:52] [INFO ] Computed 17 place invariants in 7 ms
[2021-05-13 10:01:53] [INFO ] [Real]Absence check using 0 positive and 17 generalized place invariants in 130 ms returned sat
[2021-05-13 10:01:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:01:53] [INFO ] [Real]Absence check using state equation in 663 ms returned sat
[2021-05-13 10:01:53] [INFO ] State equation strengthened by 113 read => feed constraints.
[2021-05-13 10:01:53] [INFO ] [Real]Added 113 Read/Feed constraints in 35 ms returned sat
[2021-05-13 10:01:53] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:01:53] [INFO ] [Nat]Absence check using 0 positive and 17 generalized place invariants in 16 ms returned sat
[2021-05-13 10:01:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:01:54] [INFO ] [Nat]Absence check using state equation in 361 ms returned sat
[2021-05-13 10:01:54] [INFO ] [Nat]Added 113 Read/Feed constraints in 39 ms returned sat
[2021-05-13 10:01:54] [INFO ] Computed and/alt/rep : 777/14762/662 causal constraints in 61 ms.
[2021-05-13 10:01:55] [INFO ] Added : 175 causal constraints over 35 iterations in 1634 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 28 ms.
[2021-05-13 10:01:56] [INFO ] [Real]Absence check using 0 positive and 17 generalized place invariants in 48 ms returned sat
[2021-05-13 10:01:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:01:56] [INFO ] [Real]Absence check using state equation in 360 ms returned sat
[2021-05-13 10:01:56] [INFO ] [Real]Added 113 Read/Feed constraints in 28 ms returned sat
[2021-05-13 10:01:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:01:56] [INFO ] [Nat]Absence check using 0 positive and 17 generalized place invariants in 30 ms returned sat
[2021-05-13 10:01:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:01:57] [INFO ] [Nat]Absence check using state equation in 592 ms returned sat
[2021-05-13 10:01:57] [INFO ] [Nat]Added 113 Read/Feed constraints in 96 ms returned sat
[2021-05-13 10:01:57] [INFO ] Computed and/alt/rep : 777/14762/662 causal constraints in 59 ms.
[2021-05-13 10:02:00] [INFO ] Added : 181 causal constraints over 37 iterations in 2800 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 32 ms.
[2021-05-13 10:02:00] [INFO ] [Real]Absence check using 0 positive and 17 generalized place invariants in 9 ms returned sat
[2021-05-13 10:02:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:02:00] [INFO ] [Real]Absence check using state equation in 196 ms returned sat
[2021-05-13 10:02:00] [INFO ] [Real]Added 113 Read/Feed constraints in 26 ms returned sat
[2021-05-13 10:02:00] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:02:00] [INFO ] [Nat]Absence check using 0 positive and 17 generalized place invariants in 26 ms returned sat
[2021-05-13 10:02:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:02:00] [INFO ] [Nat]Absence check using state equation in 375 ms returned sat
[2021-05-13 10:02:01] [INFO ] [Nat]Added 113 Read/Feed constraints in 79 ms returned sat
[2021-05-13 10:02:01] [INFO ] Computed and/alt/rep : 777/14762/662 causal constraints in 65 ms.
[2021-05-13 10:02:02] [INFO ] Added : 167 causal constraints over 34 iterations in 1377 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 19 ms.
Incomplete Parikh walk after 26500 steps, including 403 resets, run finished after 126 ms. (steps per millisecond=210 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 35100 steps, including 463 resets, run finished after 128 ms. (steps per millisecond=274 ) properties seen :[0, 1, 1] could not realise parikh vector
FORMULA CloudDeployment-PT-4b-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CloudDeployment-PT-4b-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 30100 steps, including 528 resets, run finished after 76 ms. (steps per millisecond=396 ) properties seen :[0] could not realise parikh vector
Support contains 22 out of 147 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 147/147 places, 778/778 transitions.
Graph (trivial) has 58 edges and 147 vertex of which 6 / 147 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 144 transition count 772
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 7 place count 144 transition count 771
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 9 place count 143 transition count 771
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 142 transition count 770
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 12 place count 142 transition count 769
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 141 transition count 778
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 15 place count 141 transition count 777
Free-agglomeration rule applied 14 times with reduction of 2 identical transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 29 place count 141 transition count 761
Reduce places removed 14 places and 0 transitions.
Drop transitions removed 30 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 3 with 50 rules applied. Total rules applied 79 place count 127 transition count 725
Symmetric choice reduction at 4 with 2 rule applications. Total rules 81 place count 127 transition count 725
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 12 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 85 place count 125 transition count 713
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 87 place count 125 transition count 711
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 88 place count 125 transition count 711
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 89 place count 125 transition count 710
Drop transitions removed 90 transitions
Redundant transition composition rules discarded 90 transitions
Iterating global reduction 6 with 90 rules applied. Total rules applied 179 place count 125 transition count 620
Applied a total of 179 rules in 117 ms. Remains 125 /147 variables (removed 22) and now considering 620/778 (removed 158) transitions.
Finished structural reductions, in 1 iterations. Remains : 125/147 places, 620/778 transitions.
Incomplete random walk after 1000000 steps, including 34822 resets, run finished after 2385 ms. (steps per millisecond=419 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 4002 resets, run finished after 786 ms. (steps per millisecond=1272 ) properties seen :[0]
Interrupted probabilistic random walk after 23990802 steps, run timeout after 30001 ms. (steps per millisecond=799 ) properties seen :[0]
Probabilistic random walk after 23990802 steps, saw 2793474 distinct states, run finished after 30013 ms. (steps per millisecond=799 ) properties seen :[0]
[2021-05-13 10:02:36] [INFO ] Flow matrix only has 481 transitions (discarded 139 similar events)
// Phase 1: matrix 481 rows 125 cols
[2021-05-13 10:02:36] [INFO ] Computed 17 place invariants in 3 ms
[2021-05-13 10:02:36] [INFO ] [Real]Absence check using 0 positive and 17 generalized place invariants in 68 ms returned sat
[2021-05-13 10:02:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:02:36] [INFO ] [Real]Absence check using state equation in 652 ms returned sat
[2021-05-13 10:02:36] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:02:36] [INFO ] [Nat]Absence check using 0 positive and 17 generalized place invariants in 13 ms returned sat
[2021-05-13 10:02:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:02:37] [INFO ] [Nat]Absence check using state equation in 540 ms returned sat
[2021-05-13 10:02:37] [INFO ] State equation strengthened by 109 read => feed constraints.
[2021-05-13 10:02:37] [INFO ] [Nat]Added 109 Read/Feed constraints in 42 ms returned sat
[2021-05-13 10:02:37] [INFO ] Computed and/alt/rep : 619/7918/480 causal constraints in 50 ms.
[2021-05-13 10:02:38] [INFO ] Added : 89 causal constraints over 18 iterations in 770 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 28 ms.
Incomplete Parikh walk after 14700 steps, including 520 resets, run finished after 33 ms. (steps per millisecond=445 ) properties seen :[0] could not realise parikh vector
Support contains 22 out of 125 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 125/125 places, 620/620 transitions.
Applied a total of 0 rules in 9 ms. Remains 125 /125 variables (removed 0) and now considering 620/620 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 125/125 places, 620/620 transitions.
Starting structural reductions, iteration 0 : 125/125 places, 620/620 transitions.
Applied a total of 0 rules in 22 ms. Remains 125 /125 variables (removed 0) and now considering 620/620 (removed 0) transitions.
[2021-05-13 10:02:38] [INFO ] Flow matrix only has 481 transitions (discarded 139 similar events)
// Phase 1: matrix 481 rows 125 cols
[2021-05-13 10:02:38] [INFO ] Computed 17 place invariants in 3 ms
[2021-05-13 10:02:38] [INFO ] Implicit Places using invariants in 441 ms returned []
[2021-05-13 10:02:38] [INFO ] Flow matrix only has 481 transitions (discarded 139 similar events)
// Phase 1: matrix 481 rows 125 cols
[2021-05-13 10:02:38] [INFO ] Computed 17 place invariants in 4 ms
[2021-05-13 10:02:39] [INFO ] State equation strengthened by 109 read => feed constraints.
[2021-05-13 10:02:39] [INFO ] Implicit Places using invariants and state equation in 1004 ms returned [2, 4, 27, 47, 49, 69]
Discarding 6 places :
Implicit Place search using SMT with State Equation took 1459 ms to find 6 implicit places.
[2021-05-13 10:02:43] [INFO ] Redundant transitions in 3084 ms returned []
[2021-05-13 10:02:43] [INFO ] Flow matrix only has 481 transitions (discarded 139 similar events)
// Phase 1: matrix 481 rows 119 cols
[2021-05-13 10:02:43] [INFO ] Computed 11 place invariants in 2 ms
[2021-05-13 10:02:43] [INFO ] Dead Transitions using invariants and state equation in 668 ms returned []
Starting structural reductions, iteration 1 : 119/125 places, 620/620 transitions.
Applied a total of 0 rules in 21 ms. Remains 119 /119 variables (removed 0) and now considering 620/620 (removed 0) transitions.
[2021-05-13 10:02:46] [INFO ] Redundant transitions in 2362 ms returned []
[2021-05-13 10:02:46] [INFO ] Flow matrix only has 481 transitions (discarded 139 similar events)
// Phase 1: matrix 481 rows 119 cols
[2021-05-13 10:02:46] [INFO ] Computed 11 place invariants in 4 ms
[2021-05-13 10:02:46] [INFO ] Dead Transitions using invariants and state equation in 546 ms returned []
Finished structural reductions, in 2 iterations. Remains : 119/125 places, 620/620 transitions.
Incomplete random walk after 1000000 steps, including 34745 resets, run finished after 2443 ms. (steps per millisecond=409 ) properties seen :[0]
Incomplete Best-First random walk after 1000000 steps, including 3968 resets, run finished after 789 ms. (steps per millisecond=1267 ) properties seen :[0]
Interrupted probabilistic random walk after 22726561 steps, run timeout after 30001 ms. (steps per millisecond=757 ) properties seen :[0]
Probabilistic random walk after 22726561 steps, saw 2637646 distinct states, run finished after 30009 ms. (steps per millisecond=757 ) properties seen :[0]
[2021-05-13 10:03:19] [INFO ] Flow matrix only has 481 transitions (discarded 139 similar events)
// Phase 1: matrix 481 rows 119 cols
[2021-05-13 10:03:19] [INFO ] Computed 11 place invariants in 2 ms
[2021-05-13 10:03:19] [INFO ] [Real]Absence check using 0 positive and 11 generalized place invariants in 7 ms returned sat
[2021-05-13 10:03:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:03:20] [INFO ] [Real]Absence check using state equation in 197 ms returned sat
[2021-05-13 10:03:20] [INFO ] State equation strengthened by 109 read => feed constraints.
[2021-05-13 10:03:20] [INFO ] [Real]Added 109 Read/Feed constraints in 31 ms returned sat
[2021-05-13 10:03:20] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:03:20] [INFO ] [Nat]Absence check using 0 positive and 11 generalized place invariants in 10 ms returned sat
[2021-05-13 10:03:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:03:20] [INFO ] [Nat]Absence check using state equation in 133 ms returned sat
[2021-05-13 10:03:20] [INFO ] [Nat]Added 109 Read/Feed constraints in 35 ms returned sat
[2021-05-13 10:03:20] [INFO ] Computed and/alt/rep : 619/7150/480 causal constraints in 29 ms.
[2021-05-13 10:03:20] [INFO ] Added : 91 causal constraints over 19 iterations in 514 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 11 ms.
Incomplete Parikh walk after 12100 steps, including 190 resets, run finished after 34 ms. (steps per millisecond=355 ) properties seen :[0] could not realise parikh vector
Support contains 22 out of 119 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 119/119 places, 620/620 transitions.
Applied a total of 0 rules in 7 ms. Remains 119 /119 variables (removed 0) and now considering 620/620 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 119/119 places, 620/620 transitions.
Starting structural reductions, iteration 0 : 119/119 places, 620/620 transitions.
Applied a total of 0 rules in 6 ms. Remains 119 /119 variables (removed 0) and now considering 620/620 (removed 0) transitions.
[2021-05-13 10:03:21] [INFO ] Flow matrix only has 481 transitions (discarded 139 similar events)
// Phase 1: matrix 481 rows 119 cols
[2021-05-13 10:03:21] [INFO ] Computed 11 place invariants in 2 ms
[2021-05-13 10:03:21] [INFO ] Implicit Places using invariants in 226 ms returned []
[2021-05-13 10:03:21] [INFO ] Flow matrix only has 481 transitions (discarded 139 similar events)
// Phase 1: matrix 481 rows 119 cols
[2021-05-13 10:03:21] [INFO ] Computed 11 place invariants in 2 ms
[2021-05-13 10:03:21] [INFO ] State equation strengthened by 109 read => feed constraints.
[2021-05-13 10:03:21] [INFO ] Implicit Places using invariants and state equation in 587 ms returned []
Implicit Place search using SMT with State Equation took 824 ms to find 0 implicit places.
[2021-05-13 10:03:23] [INFO ] Redundant transitions in 1208 ms returned []
[2021-05-13 10:03:23] [INFO ] Flow matrix only has 481 transitions (discarded 139 similar events)
// Phase 1: matrix 481 rows 119 cols
[2021-05-13 10:03:23] [INFO ] Computed 11 place invariants in 2 ms
[2021-05-13 10:03:23] [INFO ] Dead Transitions using invariants and state equation in 634 ms returned []
Finished structural reductions, in 1 iterations. Remains : 119/119 places, 620/620 transitions.
Incomplete random walk after 100000 steps, including 3452 resets, run finished after 231 ms. (steps per millisecond=432 ) properties seen :[0]
[2021-05-13 10:03:23] [INFO ] Flow matrix only has 481 transitions (discarded 139 similar events)
// Phase 1: matrix 481 rows 119 cols
[2021-05-13 10:03:23] [INFO ] Computed 11 place invariants in 2 ms
[2021-05-13 10:03:23] [INFO ] [Real]Absence check using 0 positive and 11 generalized place invariants in 6 ms returned sat
[2021-05-13 10:03:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:03:24] [INFO ] [Real]Absence check using state equation in 125 ms returned sat
[2021-05-13 10:03:24] [INFO ] State equation strengthened by 109 read => feed constraints.
[2021-05-13 10:03:24] [INFO ] [Real]Added 109 Read/Feed constraints in 20 ms returned sat
[2021-05-13 10:03:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:03:24] [INFO ] [Nat]Absence check using 0 positive and 11 generalized place invariants in 19 ms returned sat
[2021-05-13 10:03:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:03:24] [INFO ] [Nat]Absence check using state equation in 295 ms returned sat
[2021-05-13 10:03:24] [INFO ] [Nat]Added 109 Read/Feed constraints in 36 ms returned sat
[2021-05-13 10:03:24] [INFO ] Computed and/alt/rep : 619/7150/480 causal constraints in 32 ms.
[2021-05-13 10:03:25] [INFO ] Added : 91 causal constraints over 19 iterations in 493 ms. Result :sat
Graph (trivial) has 80 edges and 119 vertex of which 21 / 119 are part of one of the 3 SCC in 0 ms
Free SCC test removed 18 places
Drop transitions removed 27 transitions
Ensure Unique test removed 139 transitions
Reduce isomorphic transitions removed 166 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 0 with 170 rules applied. Total rules applied 171 place count 101 transition count 450
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 176 place count 97 transition count 449
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 176 place count 97 transition count 444
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 186 place count 92 transition count 444
Symmetric choice reduction at 2 with 2 rule applications. Total rules 188 place count 92 transition count 444
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 192 place count 90 transition count 442
Symmetric choice reduction at 2 with 2 rule applications. Total rules 194 place count 90 transition count 442
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 198 place count 88 transition count 440
Symmetric choice reduction at 2 with 2 rule applications. Total rules 200 place count 88 transition count 440
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 10 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 204 place count 86 transition count 430
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 2 with 30 rules applied. Total rules applied 234 place count 86 transition count 400
Performed 10 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 254 place count 76 transition count 388
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 258 place count 76 transition count 384
Performed 6 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 270 place count 70 transition count 408
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 271 place count 70 transition count 407
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 277 place count 70 transition count 401
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 278 place count 70 transition count 400
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 279 place count 69 transition count 400
Applied a total of 279 rules in 43 ms. Remains 69 /119 variables (removed 50) and now considering 400/620 (removed 220) transitions.
// Phase 1: matrix 400 rows 69 cols
[2021-05-13 10:03:25] [INFO ] Computed 11 place invariants in 2 ms
[2021-05-13 10:03:25] [INFO ] [Real]Absence check using 0 positive and 11 generalized place invariants in 5 ms returned sat
[2021-05-13 10:03:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:03:25] [INFO ] [Real]Absence check using state equation in 177 ms returned sat
[2021-05-13 10:03:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-13 10:03:25] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-13 10:03:25] [INFO ] Computed and/alt/rep : 399/3969/399 causal constraints in 27 ms.
[2021-05-13 10:03:25] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:03:25] [INFO ] [Nat]Absence check using 0 positive and 11 generalized place invariants in 11 ms returned sat
[2021-05-13 10:03:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:03:25] [INFO ] [Nat]Absence check using state equation in 424 ms returned sat
[2021-05-13 10:03:25] [INFO ] [Nat]Added 1 Read/Feed constraints in 15 ms returned sat
[2021-05-13 10:03:25] [INFO ] Computed and/alt/rep : 399/3969/399 causal constraints in 36 ms.
[2021-05-13 10:03:26] [INFO ] Added : 40 causal constraints over 9 iterations in 417 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 5 ms.
[2021-05-13 10:03:26] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 3 ms.
[2021-05-13 10:03:26] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 16 ms.
[2021-05-13 10:03:27] [INFO ] Flatten gal took : 339 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityFireability @ CloudDeployment-PT-4b @ 3570 seconds
vrfy: finished
info: timeLeft: 3567
rslt: Output for ReachabilityFireability @ CloudDeployment-PT-4b
{
"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": "Thu May 13 10:03:27 2021
",
"timelimit": 3570
},
"child": null,
"exit":
{
"error": null,
"localtimelimitreached": true,
"memory": 31724,
"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": 4,
"adisj": 2,
"aneg": 0,
"comp": 22,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 22,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 22,
"visible_transitions": 0
},
"processed": "E (F ((((p19 <= 0)) AND (((1 <= p76)) OR ((1 <= p2) AND (1 <= p3) AND (1 <= p5) AND (1 <= p24) AND (1 <= p25) AND (1 <= p27) AND (1 <= p44) AND (1 <= p45) AND (1 <= p47) AND (1 <= p64) AND (1 <= p69) AND (1 <= p73) AND (1 <= p92) AND (1 <= p117)) OR ((1 <= p66) AND (1 <= p67) AND (1 <= p72) AND (1 <= p85) AND (1 <= p107) AND (1 <= p116))))))",
"processed_size": 345,
"rewrites": 1,
"skeleton": "E(F(**))"
},
"net":
{
"arcs": 5473,
"conflict_clusters": 13,
"places": 119,
"places_significant": 108,
"singleton_clusters": 0,
"transitions": 620
},
"task":
{
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 24,
"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: 739/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 119
lola: finding significant places
lola: 119 places, 620 transitions, 108 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: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p76 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p3 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p25 <= 1)
lola: LP says that atomic proposition is always true: (p27 <= 1)
lola: LP says that atomic proposition is always true: (p44 <= 1)
lola: LP says that atomic proposition is always true: (p45 <= 1)
lola: LP says that atomic proposition is always true: (p47 <= 1)
lola: LP says that atomic proposition is always true: (p64 <= 1)
lola: LP says that atomic proposition is always true: (p69 <= 1)
lola: LP says that atomic proposition is always true: (p73 <= 1)
lola: LP says that atomic proposition is always true: (p92 <= 1)
lola: LP says that atomic proposition is always true: (p117 <= 1)
lola: LP says that atomic proposition is always true: (p66 <= 1)
lola: LP says that atomic proposition is always true: (p67 <= 1)
lola: LP says that atomic proposition is always true: (p72 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p107 <= 1)
lola: LP says that atomic proposition is always true: (p116 <= 1)
lola: E (F ((((p19 <= 0)) AND (((1 <= p76)) OR ((1 <= p2) AND (1 <= p3) AND (1 <= p5) AND (1 <= p24) AND (1 <= p25) AND (1 <= p27) AND (1 <= p44) AND (1 <= p45) AND (1 <= p47) AND (1 <= p64) AND (1 <= p69) AND (1 <= p73) AND (1 <= p92) AND (1 <= p117)) OR ((1 <= p66) AND (1 <= p67) AND (1 <= p72) AND (1 <= p85) AND (1 <= p107) AND (1 <= p116))))))
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 ((((p19 <= 0)) AND (((1 <= p76)) OR ((1 <= p2) AND (1 <= p3) AND (1 <= p5) AND (1 <= p24) AND (1 <= p25) AND (1 <= p27) AND (1 <= p44) AND (1 <= p45) AND (1 <= p47) AND (1 <= p64) AND (1 <= p69) AND (1 <= p73) AND (1 <= p92) AND (1 <= p117)) OR ((1 <= p66) AND (1 <= p67) AND (1 <= p72) AND (1 <= p85) AND (1 <= p107) AND (1 <= p116))))))
lola: processed formula length: 345
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: formula 0: (((p19 <= 0)) AND (((1 <= p76)) OR ((1 <= p2) AND (1 <= p3) AND (1 <= p5) AND (1 <= p24) AND (1 <= p25) AND (1 <= p27) AND (1 <= p44) AND (1 <= p45) AND (1 <= p47) AND (1 <= p64) AND (1 <= p69) AND (1 <= p73) AND (1 <= p92) AND (1 <= p117)) OR ((1 <= p66) AND (1 <= p67) AND (1 <= p72) AND (1 <= p85) AND (1 <= p107) AND (1 <= p116))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 24 literals and 3 conjunctive subformulas
lola: local time limit reached - aborting
lola: state equation: write sara problem file to ReachabilityFireability-0.sara
lola: state equation: calling and running sara
lola: memory consumption: 31724 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="CloudDeployment-PT-4b"
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 CloudDeployment-PT-4b, 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 r056-oct2-162038334700156"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CloudDeployment-PT-4b.tgz
mv CloudDeployment-PT-4b 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 '
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 ;