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-162038334700175.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-7a, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r056-oct2-162038334700175
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 800K
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 132K May 10 09:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 91K 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.2K Mar 28 15:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 28 15:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 15:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 15:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 23 03:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 23 03:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 22 12:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 22 12:49 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 420K 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-7a-ReachabilityCardinality-00
FORMULA_NAME CloudDeployment-PT-7a-ReachabilityCardinality-01
FORMULA_NAME CloudDeployment-PT-7a-ReachabilityCardinality-02
FORMULA_NAME CloudDeployment-PT-7a-ReachabilityCardinality-03
FORMULA_NAME CloudDeployment-PT-7a-ReachabilityCardinality-04
FORMULA_NAME CloudDeployment-PT-7a-ReachabilityCardinality-05
FORMULA_NAME CloudDeployment-PT-7a-ReachabilityCardinality-06
FORMULA_NAME CloudDeployment-PT-7a-ReachabilityCardinality-07
FORMULA_NAME CloudDeployment-PT-7a-ReachabilityCardinality-08
FORMULA_NAME CloudDeployment-PT-7a-ReachabilityCardinality-09
FORMULA_NAME CloudDeployment-PT-7a-ReachabilityCardinality-10
FORMULA_NAME CloudDeployment-PT-7a-ReachabilityCardinality-11
FORMULA_NAME CloudDeployment-PT-7a-ReachabilityCardinality-12
FORMULA_NAME CloudDeployment-PT-7a-ReachabilityCardinality-13
FORMULA_NAME CloudDeployment-PT-7a-ReachabilityCardinality-14
FORMULA_NAME CloudDeployment-PT-7a-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1620901535309

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-13 10:25:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2021-05-13 10:25:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 10:25:36] [INFO ] Load time of PNML (sax parser for PT used): 91 ms
[2021-05-13 10:25:36] [INFO ] Transformed 264 places.
[2021-05-13 10:25:36] [INFO ] Transformed 1174 transitions.
[2021-05-13 10:25:36] [INFO ] Found NUPN structural information;
[2021-05-13 10:25:36] [INFO ] Parsed PT model containing 264 places and 1174 transitions in 132 ms.
Ensure Unique test removed 154 transitions
Reduce redundant transitions removed 154 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 29 ms.
Working with output stream class java.io.PrintStream
FORMULA CloudDeployment-PT-7a-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-7a-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-7a-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-7a-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-7a-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-7a-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-7a-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 96 resets, run finished after 63 ms. (steps per millisecond=158 ) properties seen :[1, 1, 1, 1, 0, 1, 0, 0, 1]
FORMULA CloudDeployment-PT-7a-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-7a-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-7a-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-7a-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-7a-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-7a-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 12 ms. (steps per millisecond=833 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 14 ms. (steps per millisecond=714 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties seen :[0, 0, 0]
[2021-05-13 10:25:37] [INFO ] Flow matrix only has 475 transitions (discarded 545 similar events)
// Phase 1: matrix 475 rows 264 cols
[2021-05-13 10:25:37] [INFO ] Computed 42 place invariants in 10 ms
[2021-05-13 10:25:37] [INFO ] [Real]Absence check using 0 positive and 42 generalized place invariants in 32 ms returned sat
[2021-05-13 10:25:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:25:37] [INFO ] [Real]Absence check using state equation in 303 ms returned sat
[2021-05-13 10:25:37] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:25:37] [INFO ] [Nat]Absence check using 0 positive and 42 generalized place invariants in 102 ms returned sat
[2021-05-13 10:25:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:25:37] [INFO ] [Nat]Absence check using state equation in 201 ms returned sat
[2021-05-13 10:25:38] [INFO ] State equation strengthened by 240 read => feed constraints.
[2021-05-13 10:25:38] [INFO ] [Nat]Added 240 Read/Feed constraints in 61 ms returned sat
[2021-05-13 10:25:38] [INFO ] Computed and/alt/rep : 1019/8271/474 causal constraints in 68 ms.
[2021-05-13 10:25:39] [INFO ] Added : 264 causal constraints over 53 iterations in 1850 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 21 ms.
[2021-05-13 10:25:40] [INFO ] [Real]Absence check using 0 positive and 42 generalized place invariants in 26 ms returned sat
[2021-05-13 10:25:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:25:40] [INFO ] [Real]Absence check using state equation in 206 ms returned sat
[2021-05-13 10:25:40] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:25:40] [INFO ] [Nat]Absence check using 0 positive and 42 generalized place invariants in 281 ms returned unsat
[2021-05-13 10:25:40] [INFO ] [Real]Absence check using 0 positive and 42 generalized place invariants in 17 ms returned sat
[2021-05-13 10:25:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:25:40] [INFO ] [Real]Absence check using state equation in 221 ms returned sat
[2021-05-13 10:25:40] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:25:41] [INFO ] [Nat]Absence check using 0 positive and 42 generalized place invariants in 25 ms returned sat
[2021-05-13 10:25:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:25:41] [INFO ] [Nat]Absence check using state equation in 222 ms returned sat
[2021-05-13 10:25:41] [INFO ] [Nat]Added 240 Read/Feed constraints in 40 ms returned sat
[2021-05-13 10:25:41] [INFO ] Computed and/alt/rep : 1019/8271/474 causal constraints in 37 ms.
[2021-05-13 10:25:42] [INFO ] Added : 240 causal constraints over 48 iterations in 1474 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 16 ms.
FORMULA CloudDeployment-PT-7a-ReachabilityCardinality-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 17500 steps, including 197 resets, run finished after 55 ms. (steps per millisecond=318 ) properties seen :[0, 1] could not realise parikh vector
FORMULA CloudDeployment-PT-7a-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 24000 steps, including 168 resets, run finished after 73 ms. (steps per millisecond=328 ) properties seen :[0] could not realise parikh vector
Support contains 2 out of 264 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 264/264 places, 1020/1020 transitions.
Graph (trivial) has 278 edges and 264 vertex of which 68 / 264 are part of one of the 21 SCC in 10 ms
Free SCC test removed 47 places
Ensure Unique test removed 14 places
Drop transitions removed 248 transitions
Ensure Unique test removed 49 transitions
Reduce isomorphic transitions removed 297 transitions.
Iterating post reduction 0 with 311 rules applied. Total rules applied 312 place count 203 transition count 723
Symmetric choice reduction at 1 with 5 rule applications. Total rules 317 place count 203 transition count 723
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 5 transitions.
Iterating global reduction 1 with 10 rules applied. Total rules applied 327 place count 198 transition count 718
Symmetric choice reduction at 1 with 4 rule applications. Total rules 331 place count 198 transition count 718
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 339 place count 194 transition count 714
Symmetric choice reduction at 1 with 3 rule applications. Total rules 342 place count 194 transition count 714
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 348 place count 191 transition count 711
Symmetric choice reduction at 1 with 2 rule applications. Total rules 350 place count 191 transition count 711
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 354 place count 189 transition count 709
Symmetric choice reduction at 1 with 1 rule applications. Total rules 355 place count 189 transition count 709
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 357 place count 188 transition count 708
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: -91
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 1 with 42 rules applied. Total rules applied 399 place count 167 transition count 799
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 1 with 7 rules applied. Total rules applied 406 place count 167 transition count 17175
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 413 place count 160 transition count 17175
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 414 place count 160 transition count 17175
Partial Post-agglomeration rule applied 14 times.
Drop transitions removed 14 transitions
Iterating global reduction 2 with 14 rules applied. Total rules applied 428 place count 160 transition count 17175
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 435 place count 160 transition count 17168
Drop transitions removed 134 transitions
Redundant transition composition rules discarded 134 transitions
Iterating global reduction 3 with 134 rules applied. Total rules applied 569 place count 160 transition count 17034
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 570 place count 160 transition count 17041
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 571 place count 159 transition count 17041
Drop transitions removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 4 with 15 rules applied. Total rules applied 586 place count 159 transition count 17026
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 587 place count 158 transition count 17025
Applied a total of 587 rules in 1143 ms. Remains 158 /264 variables (removed 106) and now considering 17025/1020 (removed -16005) transitions.
Finished structural reductions, in 1 iterations. Remains : 158/264 places, 17025/1020 transitions.
Interrupted random walk after 576649 steps, including 6045 resets, run timeout after 30001 ms. (steps per millisecond=19 ) properties seen :[0]
Interrupted Best-First random walk after 779074 steps, including 1010 resets, run timeout after 5001 ms. (steps per millisecond=155 ) properties seen :[0]
Interrupted probabilistic random walk after 794900 steps, run timeout after 30001 ms. (steps per millisecond=26 ) properties seen :[0]
Probabilistic random walk after 794900 steps, saw 149132 distinct states, run finished after 30001 ms. (steps per millisecond=26 ) properties seen :[0]
[2021-05-13 10:26:49] [INFO ] Flow matrix only has 16633 transitions (discarded 392 similar events)
// Phase 1: matrix 16633 rows 158 cols
[2021-05-13 10:26:49] [INFO ] Computed 28 place invariants in 285 ms
[2021-05-13 10:26:49] [INFO ] [Real]Absence check using 0 positive and 28 generalized place invariants in 15 ms returned sat
[2021-05-13 10:26:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:26:53] [INFO ] [Real]Absence check using state equation in 3781 ms returned sat
[2021-05-13 10:26:53] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:26:53] [INFO ] [Nat]Absence check using 0 positive and 28 generalized place invariants in 16 ms returned sat
[2021-05-13 10:26:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:26:56] [INFO ] [Nat]Absence check using state equation in 3281 ms returned sat
[2021-05-13 10:26:56] [INFO ] State equation strengthened by 9 read => feed constraints.
[2021-05-13 10:26:57] [INFO ] [Nat]Added 9 Read/Feed constraints in 469 ms returned sat
[2021-05-13 10:27:00] [INFO ] Computed and/alt/rep : 16976/240547/16584 causal constraints in 3050 ms.
[2021-05-13 10:27:12] [INFO ] Added : 107 causal constraints over 22 iterations in 14744 ms. Result :sat
Incomplete Parikh walk after 10900 steps, including 117 resets, run finished after 645 ms. (steps per millisecond=16 ) properties seen :[0] could not realise parikh vector
Support contains 2 out of 158 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 158/158 places, 17025/17025 transitions.
Applied a total of 0 rules in 137 ms. Remains 158 /158 variables (removed 0) and now considering 17025/17025 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 158/158 places, 17025/17025 transitions.
Starting structural reductions, iteration 0 : 158/158 places, 17025/17025 transitions.
Applied a total of 0 rules in 140 ms. Remains 158 /158 variables (removed 0) and now considering 17025/17025 (removed 0) transitions.
[2021-05-13 10:27:13] [INFO ] Flow matrix only has 16633 transitions (discarded 392 similar events)
// Phase 1: matrix 16633 rows 158 cols
[2021-05-13 10:27:13] [INFO ] Computed 28 place invariants in 130 ms
[2021-05-13 10:27:14] [INFO ] Implicit Places using invariants in 371 ms returned []
Implicit Place search using SMT only with invariants took 380 ms to find 0 implicit places.
[2021-05-13 10:27:14] [INFO ] Flow matrix only has 16633 transitions (discarded 392 similar events)
// Phase 1: matrix 16633 rows 158 cols
[2021-05-13 10:27:14] [INFO ] Computed 28 place invariants in 157 ms
[2021-05-13 10:27:26] [INFO ] Dead Transitions using invariants and state equation in 12008 ms returned []
Finished structural reductions, in 1 iterations. Remains : 158/158 places, 17025/17025 transitions.
Incomplete random walk after 100000 steps, including 1048 resets, run finished after 5038 ms. (steps per millisecond=19 ) properties seen :[0]
[2021-05-13 10:27:31] [INFO ] Flow matrix only has 16633 transitions (discarded 392 similar events)
// Phase 1: matrix 16633 rows 158 cols
[2021-05-13 10:27:31] [INFO ] Computed 28 place invariants in 134 ms
[2021-05-13 10:27:31] [INFO ] [Real]Absence check using 0 positive and 28 generalized place invariants in 10 ms returned sat
[2021-05-13 10:27:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:27:35] [INFO ] [Real]Absence check using state equation in 4030 ms returned sat
[2021-05-13 10:27:35] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:27:35] [INFO ] [Nat]Absence check using 0 positive and 28 generalized place invariants in 47 ms returned sat
[2021-05-13 10:27:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:27:39] [INFO ] [Nat]Absence check using state equation in 3659 ms returned sat
[2021-05-13 10:27:39] [INFO ] State equation strengthened by 9 read => feed constraints.
[2021-05-13 10:27:39] [INFO ] [Nat]Added 9 Read/Feed constraints in 509 ms returned sat
[2021-05-13 10:27:43] [INFO ] Computed and/alt/rep : 16976/240547/16584 causal constraints in 3250 ms.
[2021-05-13 10:27:55] [INFO ] Added : 107 causal constraints over 22 iterations in 15129 ms. Result :sat
Graph (trivial) has 131 edges and 158 vertex of which 49 / 158 are part of one of the 7 SCC in 1 ms
Free SCC test removed 42 places
Ensure Unique test removed 13 places
Drop transitions removed 56 transitions
Ensure Unique test removed 392 transitions
Reduce isomorphic transitions removed 448 transitions.
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Iterating post reduction 0 with 482 rules applied. Total rules applied 483 place count 103 transition count 16556
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 504 place count 82 transition count 16556
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 504 place count 82 transition count 16544
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 528 place count 70 transition count 16544
Symmetric choice reduction at 2 with 6 rule applications. Total rules 534 place count 70 transition count 16544
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 6 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 546 place count 64 transition count 16538
Symmetric choice reduction at 2 with 6 rule applications. Total rules 552 place count 64 transition count 16538
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 42 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 564 place count 58 transition count 16496
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 570 place count 58 transition count 16490
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 572 place count 57 transition count 16489
Free-agglomeration rule applied 14 times with reduction of 15808 identical transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 586 place count 57 transition count 667
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 448 transitions
Reduce isomorphic transitions removed 448 transitions.
Iterating post reduction 3 with 462 rules applied. Total rules applied 1048 place count 43 transition count 219
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 1049 place count 43 transition count 219
Drop transitions removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 4 with 14 rules applied. Total rules applied 1063 place count 43 transition count 205
Free-agglomeration rule applied 6 times with reduction of 114 identical transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 1069 place count 43 transition count 85
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 18 rules applied. Total rules applied 1087 place count 37 transition count 73
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 1088 place count 37 transition count 73
Applied a total of 1088 rules in 868 ms. Remains 37 /158 variables (removed 121) and now considering 73/17025 (removed 16952) transitions.
// Phase 1: matrix 73 rows 37 cols
[2021-05-13 10:27:56] [INFO ] Computed 15 place invariants in 1 ms
[2021-05-13 10:27:56] [INFO ] [Real]Absence check using 0 positive and 15 generalized place invariants in 27 ms returned sat
[2021-05-13 10:27:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:27:56] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2021-05-13 10:27:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:27:56] [INFO ] [Nat]Absence check using 0 positive and 15 generalized place invariants in 5 ms returned sat
[2021-05-13 10:27:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:27:56] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2021-05-13 10:27:56] [INFO ] Computed and/alt/rep : 24/253/24 causal constraints in 5 ms.
[2021-05-13 10:27:56] [INFO ] Added : 6 causal constraints over 2 iterations in 31 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 3 ms.
[2021-05-13 10:27:56] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 2 ms.
[2021-05-13 10:27:56] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 114 ms.
[2021-05-13 10:27:58] [INFO ] Flatten gal took : 1226 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityCardinality @ CloudDeployment-PT-7a @ 3570 seconds

FORMULA CloudDeployment-PT-7a-ReachabilityCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS SYMMETRIES TOPOLOGICAL USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3550
rslt: Output for ReachabilityCardinality @ CloudDeployment-PT-7a

{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"localtimelimit": 0,
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=ReachabilityCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--safe",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--json=ReachabilityCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Thu May 13 10:27:58 2021
",
"timelimit": 3570
},
"child": null,
"exit":
{
"error": null,
"localtimelimitreached": true,
"memory": 2359312,
"runtime": 20.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (G ((((p61 <= 0)) OR ((1 <= p10)))))",
"processed_size": 39,
"rewrites": 2,
"skeleton": "A(G(**))"
},
"net":
{
"arcs": 136378,
"conflict_clusters": 3,
"places": 158,
"places_significant": 130,
"singleton_clusters": 0,
"transitions": 17025
},
"result":
{
"edges": 43,
"markings": 44,
"produced_by": "state space",
"value": false
},
"task":
{
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"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: 17183/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 158
lola: finding significant places
lola: 158 places, 17025 transitions, 130 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from ReachabilityCardinality.xml
lola: LP says that atomic proposition is always true: (p10 <= 1)
lola: A (G ((((p61 <= 0)) OR ((1 <= p10)))))
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 ((((p61 <= 0)) OR ((1 <= p10)))))
lola: processed formula length: 39
lola: 2 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: subprocess will run for 0 seconds at most (--localtimelimit)
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k: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 <= p61)) AND ((p10 <= 0)))
lola: state equation task get result unparse finished id 0
lola: local time limit reached - aborting
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: RESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 44 markings, 43 edges
lola: memory consumption: 2359312 KB
lola: time consumption: 20 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityCardinality.json
lola: closed JSON file ReachabilityCardinality.json
rslt: finished

--------------------
content from stderr:

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CloudDeployment-PT-7a"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="gold2020"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool gold2020"
echo " Input is CloudDeployment-PT-7a, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r056-oct2-162038334700175"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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