Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r089-tall-165260117900274.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-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 gold2021
Input is FamilyReunion-PT-L00050M0005C002P002G001, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r089-tall-165260117900274
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 7.4M
-rw-r--r-- 1 mcc users 101K Apr 30 08:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 605K Apr 30 08:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 278K Apr 30 08:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 1002K Apr 30 08:39 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 64K May 9 07:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 277K May 9 07:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 80K May 9 07:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 229K May 9 07:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.6K May 9 07:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 26K May 9 07:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 24 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 4.7M May 10 09:33 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-00
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-01
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-02
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-03
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-04
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-05
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-06
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-07
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-08
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-09
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-10
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-11
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-12
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-13
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-14
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652733463767

Running Version 0
[2022-05-16 20:37:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-16 20:37:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 20:37:45] [INFO ] Load time of PNML (sax parser for PT used): 411 ms
[2022-05-16 20:37:45] [INFO ] Transformed 12194 places.
[2022-05-16 20:37:45] [INFO ] Transformed 10560 transitions.
[2022-05-16 20:37:45] [INFO ] Parsed PT model containing 12194 places and 10560 transitions in 513 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 61 ms.
Reduce places removed 17 places and 0 transitions.
// Phase 1: matrix 10560 rows 12177 cols
[2022-05-16 20:37:47] [INFO ] Computed 2768 place invariants in 982 ms
Incomplete random walk after 10000 steps, including 3 resets, run finished after 289 ms. (steps per millisecond=34 ) properties (out of 16) seen :93
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 12) seen :28
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 12) seen :13
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 12) seen :12
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 12) seen :11
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 12) seen :13
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 12) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 12) seen :13
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 12) seen :12
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 12) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 12) seen :12
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 12) seen :13
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 12) seen :10
// Phase 1: matrix 10560 rows 12177 cols
[2022-05-16 20:37:48] [INFO ] Computed 2768 place invariants in 911 ms
[2022-05-16 20:37:50] [INFO ] [Real]Absence check using 149 positive place invariants in 332 ms returned sat
[2022-05-16 20:37:51] [INFO ] [Real]Absence check using 149 positive and 2619 generalized place invariants in 1214 ms returned sat
[2022-05-16 20:37:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 20:37:53] [INFO ] [Real]Absence check using state equation in 2118 ms returned unknown
[2022-05-16 20:37:55] [INFO ] [Real]Absence check using 149 positive place invariants in 304 ms returned sat
[2022-05-16 20:37:56] [INFO ] [Real]Absence check using 149 positive and 2619 generalized place invariants in 804 ms returned unsat
[2022-05-16 20:37:57] [INFO ] [Real]Absence check using 149 positive place invariants in 306 ms returned sat
[2022-05-16 20:37:58] [INFO ] [Real]Absence check using 149 positive and 2619 generalized place invariants in 1197 ms returned sat
[2022-05-16 20:37:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 20:38:01] [INFO ] [Real]Absence check using state equation in 2503 ms returned unknown
[2022-05-16 20:38:02] [INFO ] [Real]Absence check using 149 positive place invariants in 315 ms returned sat
[2022-05-16 20:38:03] [INFO ] [Real]Absence check using 149 positive and 2619 generalized place invariants in 1252 ms returned sat
[2022-05-16 20:38:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 20:38:06] [INFO ] [Real]Absence check using state equation in 2409 ms returned unknown
[2022-05-16 20:38:07] [INFO ] [Real]Absence check using 149 positive place invariants in 319 ms returned sat
[2022-05-16 20:38:08] [INFO ] [Real]Absence check using 149 positive and 2619 generalized place invariants in 1197 ms returned sat
[2022-05-16 20:38:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 20:38:11] [INFO ] [Real]Absence check using state equation in 2516 ms returned unknown
[2022-05-16 20:38:12] [INFO ] [Real]Absence check using 149 positive place invariants in 315 ms returned sat
[2022-05-16 20:38:13] [INFO ] [Real]Absence check using 149 positive and 2619 generalized place invariants in 1270 ms returned sat
[2022-05-16 20:38:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 20:38:16] [INFO ] [Real]Absence check using state equation in 2308 ms returned unknown
[2022-05-16 20:38:17] [INFO ] [Real]Absence check using 149 positive place invariants in 204 ms returned unsat
[2022-05-16 20:38:18] [INFO ] [Real]Absence check using 149 positive place invariants in 272 ms returned sat
[2022-05-16 20:38:19] [INFO ] [Real]Absence check using 149 positive and 2619 generalized place invariants in 1132 ms returned sat
[2022-05-16 20:38:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 20:38:22] [INFO ] [Real]Absence check using state equation in 2646 ms returned unknown
[2022-05-16 20:38:23] [INFO ] [Real]Absence check using 149 positive place invariants in 292 ms returned sat
[2022-05-16 20:38:24] [INFO ] [Real]Absence check using 149 positive and 2619 generalized place invariants in 1127 ms returned sat
[2022-05-16 20:38:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 20:38:27] [INFO ] [Real]Absence check using state equation in 2631 ms returned unknown
[2022-05-16 20:38:28] [INFO ] [Real]Absence check using 149 positive place invariants in 278 ms returned sat
[2022-05-16 20:38:29] [INFO ] [Real]Absence check using 149 positive and 2619 generalized place invariants in 1138 ms returned sat
[2022-05-16 20:38:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 20:38:32] [INFO ] [Real]Absence check using state equation in 2586 ms returned unknown
[2022-05-16 20:38:33] [INFO ] [Real]Absence check using 149 positive place invariants in 282 ms returned sat
[2022-05-16 20:38:34] [INFO ] [Real]Absence check using 149 positive and 2619 generalized place invariants in 414 ms returned unsat
[2022-05-16 20:38:35] [INFO ] [Real]Absence check using 149 positive place invariants in 296 ms returned sat
[2022-05-16 20:38:36] [INFO ] [Real]Absence check using 149 positive and 2619 generalized place invariants in 1177 ms returned sat
[2022-05-16 20:38:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 20:38:39] [INFO ] [Real]Absence check using state equation in 2526 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1, 2, -1, -1, -1, -1, 2, -1, 1, -1, 1, 1] Max seen :[28, 2, 22, 20, 6, 10, 2, 10, 0, 5, 1, 0]
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-06 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-01 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 666 out of 12177 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 12177/12177 places, 10560/10560 transitions.
Graph (complete) has 18927 edges and 12177 vertex of which 10771 are kept as prefixes of interest. Removing 1406 places using SCC suffix rule.38 ms
Discarding 1406 places :
Also discarding 1278 output transitions
Drop transitions removed 1278 transitions
Drop transitions removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Discarding 1530 places :
Implicit places reduction removed 1530 places
Drop transitions removed 3872 transitions
Trivial Post-agglo rules discarded 3872 transitions
Performed 3872 trivial Post agglomeration. Transition count delta: 3872
Iterating post reduction 0 with 5504 rules applied. Total rules applied 5505 place count 9241 transition count 5308
Reduce places removed 3872 places and 0 transitions.
Performed 664 Post agglomeration using F-continuation condition.Transition count delta: 664
Iterating post reduction 1 with 4536 rules applied. Total rules applied 10041 place count 5369 transition count 4644
Reduce places removed 664 places and 0 transitions.
Iterating post reduction 2 with 664 rules applied. Total rules applied 10705 place count 4705 transition count 4644
Performed 459 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 459 Pre rules applied. Total rules applied 10705 place count 4705 transition count 4185
Deduced a syphon composed of 459 places in 4 ms
Ensure Unique test removed 153 places
Reduce places removed 612 places and 0 transitions.
Iterating global reduction 3 with 1071 rules applied. Total rules applied 11776 place count 4093 transition count 4185
Discarding 153 places :
Implicit places reduction removed 153 places
Drop transitions removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 3 with 204 rules applied. Total rules applied 11980 place count 3940 transition count 4134
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 4 with 51 rules applied. Total rules applied 12031 place count 3889 transition count 4134
Discarding 713 places :
Symmetric choice reduction at 5 with 713 rule applications. Total rules 12744 place count 3176 transition count 3421
Iterating global reduction 5 with 713 rules applied. Total rules applied 13457 place count 3176 transition count 3421
Ensure Unique test removed 153 transitions
Reduce isomorphic transitions removed 153 transitions.
Discarding 102 places :
Implicit places reduction removed 102 places
Drop transitions removed 102 transitions
Trivial Post-agglo rules discarded 102 transitions
Performed 102 trivial Post agglomeration. Transition count delta: 102
Iterating post reduction 5 with 357 rules applied. Total rules applied 13814 place count 3074 transition count 3166
Reduce places removed 102 places and 0 transitions.
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Iterating post reduction 6 with 153 rules applied. Total rules applied 13967 place count 2972 transition count 3115
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 7 with 51 rules applied. Total rules applied 14018 place count 2921 transition count 3115
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 14018 place count 2921 transition count 3114
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 14020 place count 2920 transition count 3114
Discarding 7 places :
Symmetric choice reduction at 8 with 7 rule applications. Total rules 14027 place count 2913 transition count 2757
Iterating global reduction 8 with 7 rules applied. Total rules applied 14034 place count 2913 transition count 2757
Discarding 51 places :
Implicit places reduction removed 51 places
Drop transitions removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 8 with 102 rules applied. Total rules applied 14136 place count 2862 transition count 2706
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 9 with 51 rules applied. Total rules applied 14187 place count 2811 transition count 2706
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 51 Pre rules applied. Total rules applied 14187 place count 2811 transition count 2655
Deduced a syphon composed of 51 places in 3 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 10 with 102 rules applied. Total rules applied 14289 place count 2760 transition count 2655
Performed 408 Post agglomeration using F-continuation condition.Transition count delta: 408
Deduced a syphon composed of 408 places in 1 ms
Ensure Unique test removed 306 places
Reduce places removed 714 places and 0 transitions.
Iterating global reduction 10 with 1122 rules applied. Total rules applied 15411 place count 2046 transition count 2247
Free-agglomeration rule (complex) applied 357 times.
Iterating global reduction 10 with 357 rules applied. Total rules applied 15768 place count 2046 transition count 1890
Ensure Unique test removed 51 places
Reduce places removed 408 places and 0 transitions.
Iterating post reduction 10 with 408 rules applied. Total rules applied 16176 place count 1638 transition count 1890
Applied a total of 16176 rules in 2634 ms. Remains 1638 /12177 variables (removed 10539) and now considering 1890/10560 (removed 8670) transitions.
Finished structural reductions, in 1 iterations. Remains : 1638/12177 places, 1890/10560 transitions.
// Phase 1: matrix 1890 rows 1638 cols
[2022-05-16 20:38:41] [INFO ] Computed 155 place invariants in 16 ms
Incomplete random walk after 1000000 steps, including 1397 resets, run finished after 15906 ms. (steps per millisecond=62 ) properties (out of 9) seen :131
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 9 resets, run finished after 1888 ms. (steps per millisecond=529 ) properties (out of 7) seen :57
Incomplete Best-First random walk after 1000001 steps, including 37 resets, run finished after 4585 ms. (steps per millisecond=218 ) properties (out of 7) seen :69
Incomplete Best-First random walk after 1000001 steps, including 34 resets, run finished after 1828 ms. (steps per millisecond=547 ) properties (out of 7) seen :89
Incomplete Best-First random walk after 1000001 steps, including 31 resets, run finished after 1699 ms. (steps per millisecond=588 ) properties (out of 7) seen :107
Incomplete Best-First random walk after 1000001 steps, including 26 resets, run finished after 2940 ms. (steps per millisecond=340 ) properties (out of 7) seen :128
Incomplete Best-First random walk after 1000001 steps, including 17 resets, run finished after 1708 ms. (steps per millisecond=585 ) properties (out of 7) seen :119
Incomplete Best-First random walk after 1000001 steps, including 23 resets, run finished after 1344 ms. (steps per millisecond=744 ) properties (out of 7) seen :131
// Phase 1: matrix 1890 rows 1638 cols
[2022-05-16 20:39:13] [INFO ] Computed 155 place invariants in 20 ms
[2022-05-16 20:39:13] [INFO ] [Real]Absence check using 0 positive and 155 generalized place invariants in 36 ms returned sat
[2022-05-16 20:39:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 20:39:14] [INFO ] [Real]Absence check using state equation in 166 ms returned unsat
[2022-05-16 20:39:14] [INFO ] [Real]Absence check using 0 positive and 155 generalized place invariants in 35 ms returned sat
[2022-05-16 20:39:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 20:39:14] [INFO ] [Real]Absence check using state equation in 392 ms returned unsat
[2022-05-16 20:39:14] [INFO ] [Real]Absence check using 0 positive and 155 generalized place invariants in 40 ms returned sat
[2022-05-16 20:39:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 20:39:15] [INFO ] [Real]Absence check using state equation in 324 ms returned unsat
[2022-05-16 20:39:15] [INFO ] [Real]Absence check using 0 positive and 155 generalized place invariants in 34 ms returned sat
[2022-05-16 20:39:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 20:39:15] [INFO ] [Real]Absence check using state equation in 393 ms returned unsat
[2022-05-16 20:39:15] [INFO ] [Real]Absence check using 0 positive and 155 generalized place invariants in 36 ms returned sat
[2022-05-16 20:39:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 20:39:16] [INFO ] [Real]Absence check using state equation in 615 ms returned unsat
[2022-05-16 20:39:16] [INFO ] [Real]Absence check using 0 positive and 155 generalized place invariants in 34 ms returned sat
[2022-05-16 20:39:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 20:39:17] [INFO ] [Real]Absence check using state equation in 489 ms returned unsat
[2022-05-16 20:39:17] [INFO ] [Real]Absence check using 0 positive and 155 generalized place invariants in 36 ms returned sat
[2022-05-16 20:39:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 20:39:17] [INFO ] [Real]Absence check using state equation in 656 ms returned sat
[2022-05-16 20:39:18] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 20:39:18] [INFO ] [Nat]Absence check using 0 positive and 155 generalized place invariants in 36 ms returned sat
[2022-05-16 20:39:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 20:39:18] [INFO ] [Nat]Absence check using state equation in 649 ms returned sat
[2022-05-16 20:39:19] [INFO ] Computed and/alt/rep : 1635/2196/1635 causal constraints (skipped 204 transitions) in 144 ms.
[2022-05-16 20:39:26] [INFO ] Added : 432 causal constraints over 87 iterations in 7806 ms. Result :sat
Minimization took 407 ms.
Current structural bounds on expressions (after SMT) : [51, 51, 51, 51, 51, 51, -1] Max seen :[51, 51, 51, 51, 51, 51, 29]
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-07 51 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-05 51 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-04 51 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-03 51 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-02 51 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-00 51 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Incomplete Parikh walk after 71400 steps, including 101 resets, run finished after 451 ms. (steps per millisecond=158 ) properties (out of 1) seen :51 could not realise parikh vector
Support contains 1 out of 1638 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1638/1638 places, 1890/1890 transitions.
Drop transitions removed 309 transitions
Trivial Post-agglo rules discarded 309 transitions
Performed 309 trivial Post agglomeration. Transition count delta: 309
Iterating post reduction 0 with 309 rules applied. Total rules applied 309 place count 1638 transition count 1581
Reduce places removed 309 places and 0 transitions.
Iterating post reduction 1 with 309 rules applied. Total rules applied 618 place count 1329 transition count 1581
Performed 102 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 102 Pre rules applied. Total rules applied 618 place count 1329 transition count 1479
Deduced a syphon composed of 102 places in 1 ms
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 2 with 204 rules applied. Total rules applied 822 place count 1227 transition count 1479
Discarding 357 places :
Symmetric choice reduction at 2 with 357 rule applications. Total rules 1179 place count 870 transition count 1122
Iterating global reduction 2 with 357 rules applied. Total rules applied 1536 place count 870 transition count 1122
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Drop transitions removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 2 with 153 rules applied. Total rules applied 1689 place count 870 transition count 969
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 3 with 51 rules applied. Total rules applied 1740 place count 819 transition count 969
Discarding 255 places :
Symmetric choice reduction at 4 with 255 rule applications. Total rules 1995 place count 564 transition count 714
Iterating global reduction 4 with 255 rules applied. Total rules applied 2250 place count 564 transition count 714
Ensure Unique test removed 255 transitions
Reduce isomorphic transitions removed 255 transitions.
Discarding 51 places :
Implicit places reduction removed 51 places
Drop transitions removed 102 transitions
Trivial Post-agglo rules discarded 102 transitions
Performed 102 trivial Post agglomeration. Transition count delta: 102
Iterating post reduction 4 with 408 rules applied. Total rules applied 2658 place count 513 transition count 357
Reduce places removed 102 places and 0 transitions.
Iterating post reduction 5 with 102 rules applied. Total rules applied 2760 place count 411 transition count 357
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 0 ms
Ensure Unique test removed 51 places
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 6 with 153 rules applied. Total rules applied 2913 place count 309 transition count 306
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 2914 place count 308 transition count 305
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 2915 place count 307 transition count 304
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 2916 place count 306 transition count 303
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 2917 place count 305 transition count 302
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 2918 place count 304 transition count 301
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 2919 place count 303 transition count 300
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 2920 place count 302 transition count 299
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 2921 place count 301 transition count 298
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 2922 place count 300 transition count 297
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 2923 place count 299 transition count 296
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 2924 place count 298 transition count 295
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 2925 place count 297 transition count 294
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 2926 place count 296 transition count 293
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 2927 place count 295 transition count 292
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 2928 place count 294 transition count 291
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 2929 place count 293 transition count 290
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 2930 place count 292 transition count 289
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 2931 place count 291 transition count 288
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 2932 place count 290 transition count 287
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 2933 place count 289 transition count 286
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 2934 place count 288 transition count 285
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 2935 place count 287 transition count 284
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 2936 place count 286 transition count 283
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 2937 place count 285 transition count 282
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 2938 place count 284 transition count 281
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 2939 place count 283 transition count 280
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 2940 place count 282 transition count 279
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 2941 place count 281 transition count 278
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 2942 place count 280 transition count 277
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 2943 place count 279 transition count 276
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 2944 place count 278 transition count 275
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 2945 place count 277 transition count 274
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 2946 place count 276 transition count 273
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 2947 place count 275 transition count 272
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 2948 place count 274 transition count 271
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 2949 place count 273 transition count 270
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 2950 place count 272 transition count 269
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 2951 place count 271 transition count 268
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 2952 place count 270 transition count 267
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 2953 place count 269 transition count 266
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 2954 place count 268 transition count 265
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 2955 place count 267 transition count 264
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 2956 place count 266 transition count 263
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 2957 place count 265 transition count 262
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 2958 place count 264 transition count 261
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 2959 place count 263 transition count 260
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 2960 place count 262 transition count 259
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 2961 place count 261 transition count 258
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 2962 place count 260 transition count 257
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 2963 place count 259 transition count 256
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 2964 place count 258 transition count 255
Applied a total of 2964 rules in 414 ms. Remains 258 /1638 variables (removed 1380) and now considering 255/1890 (removed 1635) transitions.
Finished structural reductions, in 1 iterations. Remains : 258/1638 places, 255/1890 transitions.
// Phase 1: matrix 255 rows 258 cols
[2022-05-16 20:39:28] [INFO ] Computed 53 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 6494 resets, run finished after 7988 ms. (steps per millisecond=125 ) properties (out of 1) seen :12
Incomplete Best-First random walk after 1000001 steps, including 115 resets, run finished after 1356 ms. (steps per millisecond=737 ) properties (out of 1) seen :38
// Phase 1: matrix 255 rows 258 cols
[2022-05-16 20:39:37] [INFO ] Computed 53 place invariants in 12 ms
[2022-05-16 20:39:37] [INFO ] [Real]Absence check using 0 positive and 53 generalized place invariants in 25 ms returned sat
[2022-05-16 20:39:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 20:39:37] [INFO ] [Real]Absence check using state equation in 51 ms returned unsat
Current structural bounds on expressions (after SMT) : [51] Max seen :[51]
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-11 51 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.

BK_STOP 1652733587783

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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="FamilyReunion-PT-L00050M0005C002P002G001"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2021"
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 gold2021"
echo " Input is FamilyReunion-PT-L00050M0005C002P002G001, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r089-tall-165260117900274"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FamilyReunion-PT-L00050M0005C002P002G001.tgz
mv FamilyReunion-PT-L00050M0005C002P002G001 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "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 [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.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 '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
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 ;